/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:34:55,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:34:55,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:34:55,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:34:55,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:34:55,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:34:55,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:34:55,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:34:55,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:34:55,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:34:55,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:34:55,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:34:55,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:34:55,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:34:55,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:34:55,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:34:55,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:34:55,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:34:55,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:34:55,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:34:55,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:34:55,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:34:55,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:34:55,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:34:55,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:34:55,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:34:55,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:34:55,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:34:55,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:34:55,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:34:55,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:34:55,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:34:55,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:34:55,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:34:55,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:34:55,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:34:55,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:34:55,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:34:55,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:34:55,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:34:55,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:34:55,458 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-11 23:34:55,485 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:34:55,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:34:55,486 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:34:55,487 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:34:55,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:34:55,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:34:55,488 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:34:55,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:34:55,488 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:34:55,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:34:55,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:34:55,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:34:55,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:34:55,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:34:55,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:34:55,489 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:34:55,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:34:55,489 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:34:55,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:34:55,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:34:55,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:34:55,490 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:34:55,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:34:55,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:34:55,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:34:55,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:34:55,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:34:55,491 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:34:55,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:34:55,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:34:55,491 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:34:55,491 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-11 23:34:55,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:34:55,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:34:55,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:34:55,747 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:34:55,748 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:34:55,749 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-11 23:34:56,633 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:34:56,876 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:34:56,876 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-11 23:34:56,890 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8164b86/8402b8718e4449f88f48035c216dc2a9/FLAG2180bca8a [2022-12-11 23:34:56,899 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8164b86/8402b8718e4449f88f48035c216dc2a9 [2022-12-11 23:34:56,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:34:56,903 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:34:56,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:34:56,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:34:56,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:34:56,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:34:56" (1/1) ... [2022-12-11 23:34:56,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6517da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:34:56, skipping insertion in model container [2022-12-11 23:34:56,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:34:56" (1/1) ... [2022-12-11 23:34:56,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:34:56,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:34:57,042 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2022-12-11 23:34:57,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:34:57,222 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:34:57,232 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2022-12-11 23:34:57,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:34:57,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:34:57,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:34:57,326 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:34:57,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:34:57 WrapperNode [2022-12-11 23:34:57,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:34:57,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:34:57,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:34:57,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:34:57,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:34:57" (1/1) ... [2022-12-11 23:34:57,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:34:57" (1/1) ... [2022-12-11 23:34:57,381 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-11 23:34:57,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:34:57,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:34:57,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:34:57,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:34:57,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:34:57" (1/1) ... [2022-12-11 23:34:57,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:34:57" (1/1) ... [2022-12-11 23:34:57,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:34:57" (1/1) ... [2022-12-11 23:34:57,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:34:57" (1/1) ... [2022-12-11 23:34:57,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:34:57" (1/1) ... [2022-12-11 23:34:57,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:34:57" (1/1) ... [2022-12-11 23:34:57,410 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:34:57" (1/1) ... [2022-12-11 23:34:57,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:34:57" (1/1) ... [2022-12-11 23:34:57,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:34:57,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:34:57,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:34:57,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:34:57,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:34:57" (1/1) ... [2022-12-11 23:34:57,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:34:57,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:34:57,451 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-11 23:34:57,461 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-11 23:34:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:34:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 23:34:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:34:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:34:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:34:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 23:34:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 23:34:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 23:34:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 23:34:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 23:34:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 23:34:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:34:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 23:34:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:34:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:34:57,484 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 23:34:57,580 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:34:57,581 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:34:57,836 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:34:57,934 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:34:57,934 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 23:34:57,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:34:57 BoogieIcfgContainer [2022-12-11 23:34:57,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:34:57,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:34:57,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:34:57,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:34:57,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:34:56" (1/3) ... [2022-12-11 23:34:57,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d198b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:34:57, skipping insertion in model container [2022-12-11 23:34:57,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:34:57" (2/3) ... [2022-12-11 23:34:57,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d198b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:34:57, skipping insertion in model container [2022-12-11 23:34:57,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:34:57" (3/3) ... [2022-12-11 23:34:57,941 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-11 23:34:57,970 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:34:57,970 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 23:34:57,970 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:34:58,054 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 23:34:58,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-11 23:34:58,147 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-11 23:34:58,147 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:34:58,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-11 23:34:58,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-11 23:34:58,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-11 23:34:58,163 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:34:58,167 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;@6c58c924, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:34:58,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 23:34:58,174 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-12-11 23:34:58,175 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:34:58,175 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:34:58,178 INFO L214 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] [2022-12-11 23:34:58,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:34:58,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:34:58,185 INFO L85 PathProgramCache]: Analyzing trace with hash -650301474, now seen corresponding path program 1 times [2022-12-11 23:34:58,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:34:58,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191857242] [2022-12-11 23:34:58,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:34:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:34:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:34:58,605 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-11 23:34:58,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:34:58,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191857242] [2022-12-11 23:34:58,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191857242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:34:58,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:34:58,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 23:34:58,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006986739] [2022-12-11 23:34:58,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:34:58,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:34:58,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:34:58,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:34:58,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:34:58,654 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2022-12-11 23:34:58,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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-11 23:34:58,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:34:58,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2022-12-11 23:34:58,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:34:58,773 INFO L130 PetriNetUnfolder]: 58/271 cut-off events. [2022-12-11 23:34:58,774 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-11 23:34:58,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 271 events. 58/271 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1102 event pairs, 10 based on Foata normal form. 25/280 useless extension candidates. Maximal degree in co-relation 350. Up to 79 conditions per place. [2022-12-11 23:34:58,777 INFO L137 encePairwiseOnDemand]: 105/110 looper letters, 14 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2022-12-11 23:34:58,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 109 transitions, 265 flow [2022-12-11 23:34:58,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:34:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:34:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2022-12-11 23:34:58,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9363636363636364 [2022-12-11 23:34:58,791 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 0 predicate places. [2022-12-11 23:34:58,791 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 109 transitions, 265 flow [2022-12-11 23:34:58,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 109 transitions, 265 flow [2022-12-11 23:34:58,794 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 109 transitions, 265 flow [2022-12-11 23:34:58,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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-11 23:34:58,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:34:58,795 INFO L214 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] [2022-12-11 23:34:58,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:34:58,795 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:34:58,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:34:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash -822883475, now seen corresponding path program 1 times [2022-12-11 23:34:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:34:58,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559147898] [2022-12-11 23:34:58,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:34:58,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:34:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:34:59,169 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-11 23:34:59,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:34:59,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559147898] [2022-12-11 23:34:59,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559147898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:34:59,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:34:59,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:34:59,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795326971] [2022-12-11 23:34:59,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:34:59,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:34:59,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:34:59,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:34:59,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:34:59,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 110 [2022-12-11 23:34:59,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 109 transitions, 265 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-11 23:34:59,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:34:59,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 110 [2022-12-11 23:34:59,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:34:59,738 INFO L130 PetriNetUnfolder]: 1128/2802 cut-off events. [2022-12-11 23:34:59,738 INFO L131 PetriNetUnfolder]: For 753/1020 co-relation queries the response was YES. [2022-12-11 23:34:59,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5420 conditions, 2802 events. 1128/2802 cut-off events. For 753/1020 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 21670 event pairs, 372 based on Foata normal form. 0/2707 useless extension candidates. Maximal degree in co-relation 5366. Up to 1028 conditions per place. [2022-12-11 23:34:59,756 INFO L137 encePairwiseOnDemand]: 103/110 looper letters, 30 selfloop transitions, 3 changer transitions 64/171 dead transitions. [2022-12-11 23:34:59,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 171 transitions, 643 flow [2022-12-11 23:34:59,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:34:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:34:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 847 transitions. [2022-12-11 23:34:59,760 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8555555555555555 [2022-12-11 23:34:59,761 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 8 predicate places. [2022-12-11 23:34:59,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 171 transitions, 643 flow [2022-12-11 23:34:59,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 107 transitions, 345 flow [2022-12-11 23:34:59,771 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 345 flow [2022-12-11 23:34:59,771 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-11 23:34:59,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:34:59,771 INFO L214 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-11 23:34:59,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 23:34:59,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:34:59,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:34:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash 901698956, now seen corresponding path program 1 times [2022-12-11 23:34:59,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:34:59,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560404446] [2022-12-11 23:34:59,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:34:59,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:34:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:34:59,992 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-11 23:34:59,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:34:59,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560404446] [2022-12-11 23:34:59,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560404446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:34:59,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:34:59,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:34:59,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702885020] [2022-12-11 23:34:59,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:34:59,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:34:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:34:59,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:34:59,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:34:59,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 110 [2022-12-11 23:34:59,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 345 flow. Second operand has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 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-11 23:34:59,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:34:59,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 110 [2022-12-11 23:34:59,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:35:00,549 INFO L130 PetriNetUnfolder]: 1512/2897 cut-off events. [2022-12-11 23:35:00,549 INFO L131 PetriNetUnfolder]: For 1036/5694 co-relation queries the response was YES. [2022-12-11 23:35:00,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8636 conditions, 2897 events. 1512/2897 cut-off events. For 1036/5694 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19120 event pairs, 167 based on Foata normal form. 84/2936 useless extension candidates. Maximal degree in co-relation 8575. Up to 2096 conditions per place. [2022-12-11 23:35:00,563 INFO L137 encePairwiseOnDemand]: 101/110 looper letters, 54 selfloop transitions, 6 changer transitions 92/222 dead transitions. [2022-12-11 23:35:00,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 222 transitions, 1239 flow [2022-12-11 23:35:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:35:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:35:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1180 transitions. [2022-12-11 23:35:00,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8251748251748252 [2022-12-11 23:35:00,567 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 4 predicate places. [2022-12-11 23:35:00,567 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 222 transitions, 1239 flow [2022-12-11 23:35:00,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 130 transitions, 585 flow [2022-12-11 23:35:00,577 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 130 transitions, 585 flow [2022-12-11 23:35:00,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 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-11 23:35:00,577 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:35:00,578 INFO L214 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] [2022-12-11 23:35:00,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:35:00,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:35:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:35:00,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1280240610, now seen corresponding path program 1 times [2022-12-11 23:35:00,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:35:00,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968350045] [2022-12-11 23:35:00,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:35:00,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:35:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:35:00,693 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-11 23:35:00,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:35:00,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968350045] [2022-12-11 23:35:00,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968350045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:35:00,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:35:00,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:35:00,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543585877] [2022-12-11 23:35:00,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:35:00,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:35:00,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:35:00,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:35:00,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:35:00,695 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 110 [2022-12-11 23:35:00,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 130 transitions, 585 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-11 23:35:00,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:35:00,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 110 [2022-12-11 23:35:00,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:35:00,995 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_113 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd2~0_23 (ite .cse0 0 v_~z$r_buff0_thd2~0_24)) (= v_~z$w_buff0_used~0_127 (ite .cse1 0 v_~z$w_buff0_used~0_128)) (= v_~z$w_buff1_used~0_112 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_113)) (= v_~z~0_66 (ite .cse1 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_48 v_~z~0_67))) (= v_~z$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_112 256)))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_23 256) 0)))) 0 v_~z$r_buff1_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_24} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_66, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_23} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][143], [111#L785true, 124#true, P0Thread1of1ForFork0InUse, 172#(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)), 143#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork2InUse, 61#L2true, P1Thread1of1ForFork1InUse, 47#L755true, 97#L798true, 121#true]) [2022-12-11 23:35:00,995 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-11 23:35:00,996 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 23:35:00,996 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 23:35:00,996 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 23:35:00,996 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][146], [124#true, 140#true, P0Thread1of1ForFork0InUse, 172#(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)), P2Thread1of1ForFork2InUse, 61#L2true, 16#L814true, P1Thread1of1ForFork1InUse, 47#L755true, 92#L778true, 121#true]) [2022-12-11 23:35:00,996 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-11 23:35:00,996 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 23:35:00,996 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 23:35:00,996 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 23:35:01,039 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_113 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd2~0_23 (ite .cse0 0 v_~z$r_buff0_thd2~0_24)) (= v_~z$w_buff0_used~0_127 (ite .cse1 0 v_~z$w_buff0_used~0_128)) (= v_~z$w_buff1_used~0_112 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_113)) (= v_~z~0_66 (ite .cse1 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_48 v_~z~0_67))) (= v_~z$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_112 256)))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_23 256) 0)))) 0 v_~z$r_buff1_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_24} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_66, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_23} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][147], [51#L3true, 111#L785true, 124#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 143#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P1Thread1of1ForFork1InUse, 47#L755true, 97#L798true, 174#(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]) [2022-12-11 23:35:01,040 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,040 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,040 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,040 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,040 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][151], [51#L3true, 124#true, 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 16#L814true, 47#L755true, 174#(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)), 92#L778true, 121#true]) [2022-12-11 23:35:01,040 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,040 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,040 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,040 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,041 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][111], [P0Thread1of1ForFork0InUse, 124#true, 140#true, 172#(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)), P2Thread1of1ForFork2InUse, 61#L2true, P1Thread1of1ForFork1InUse, 16#L814true, 50#L758true, 92#L778true, 121#true]) [2022-12-11 23:35:01,041 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,041 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,041 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,041 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,042 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L758-->L765: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_131 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff1_used~0_117 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_132 256) 0)))) (.cse1 (and .cse5 .cse4))) (and (= v_~z$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_117)) (= (ite .cse2 v_~z$w_buff0~0_49 (ite .cse0 v_~z$w_buff1~0_50 v_~z~0_71)) v_~z~0_70) (= v_~z$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_116 256) 0))) (and (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_20)) (= (ite .cse2 0 v_~z$w_buff0_used~0_132) v_~z$w_buff0_used~0_131) (= v_~z$r_buff0_thd1~0_28 (ite .cse1 0 v_~z$r_buff0_thd1~0_29))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_117, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_71, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_116, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_70, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][112], [42#L765true, 124#true, 140#true, P0Thread1of1ForFork0InUse, 172#(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)), P2Thread1of1ForFork2InUse, 61#L2true, P1Thread1of1ForFork1InUse, 97#L798true, 92#L778true, 121#true]) [2022-12-11 23:35:01,042 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,042 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,042 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,042 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,042 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_113 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd2~0_23 (ite .cse0 0 v_~z$r_buff0_thd2~0_24)) (= v_~z$w_buff0_used~0_127 (ite .cse1 0 v_~z$w_buff0_used~0_128)) (= v_~z$w_buff1_used~0_112 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_113)) (= v_~z~0_66 (ite .cse1 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_48 v_~z~0_67))) (= v_~z$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_112 256)))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_23 256) 0)))) 0 v_~z$r_buff1_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_24} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_66, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_23} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][168], [111#L785true, 124#true, 140#true, P0Thread1of1ForFork0InUse, 172#(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)), P2Thread1of1ForFork2InUse, 61#L2true, P1Thread1of1ForFork1InUse, 50#L758true, 97#L798true, 121#true]) [2022-12-11 23:35:01,042 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,042 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,042 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,042 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 23:35:01,087 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][149], [51#L3true, P0Thread1of1ForFork0InUse, 124#true, 140#true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 16#L814true, 50#L758true, 174#(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, 92#L778true]) [2022-12-11 23:35:01,087 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,087 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,087 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,087 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,090 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_113 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd2~0_23 (ite .cse0 0 v_~z$r_buff0_thd2~0_24)) (= v_~z$w_buff0_used~0_127 (ite .cse1 0 v_~z$w_buff0_used~0_128)) (= v_~z$w_buff1_used~0_112 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_113)) (= v_~z~0_66 (ite .cse1 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_48 v_~z~0_67))) (= v_~z$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_112 256)))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_23 256) 0)))) 0 v_~z$r_buff1_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_24} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_66, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_23} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][209], [111#L785true, 51#L3true, 124#true, 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 50#L758true, 97#L798true, 174#(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]) [2022-12-11 23:35:01,091 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,091 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,091 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,091 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,111 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_113 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd2~0_23 (ite .cse0 0 v_~z$r_buff0_thd2~0_24)) (= v_~z$w_buff0_used~0_127 (ite .cse1 0 v_~z$w_buff0_used~0_128)) (= v_~z$w_buff1_used~0_112 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_113)) (= v_~z~0_66 (ite .cse1 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_48 v_~z~0_67))) (= v_~z$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_112 256)))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_23 256) 0)))) 0 v_~z$r_buff1_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_24} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_66, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_23} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][147], [111#L785true, P0Thread1of1ForFork0InUse, 124#true, P2Thread1of1ForFork2InUse, 143#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P1Thread1of1ForFork1InUse, 47#L755true, 109#L3-1true, 97#L798true, 174#(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]) [2022-12-11 23:35:01,111 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,111 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,112 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,112 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,113 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][151], [124#true, 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 16#L814true, P1Thread1of1ForFork1InUse, 47#L755true, 109#L3-1true, 174#(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)), 92#L778true, 121#true]) [2022-12-11 23:35:01,113 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,113 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,113 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,113 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 23:35:01,144 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][149], [124#true, 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 16#L814true, 50#L758true, 109#L3-1true, 174#(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)), 92#L778true, 121#true]) [2022-12-11 23:35:01,145 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-11 23:35:01,145 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 23:35:01,145 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 23:35:01,145 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 23:35:01,148 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L758-->L765: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_131 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff1_used~0_117 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_132 256) 0)))) (.cse1 (and .cse5 .cse4))) (and (= v_~z$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_117)) (= (ite .cse2 v_~z$w_buff0~0_49 (ite .cse0 v_~z$w_buff1~0_50 v_~z~0_71)) v_~z~0_70) (= v_~z$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_116 256) 0))) (and (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_20)) (= (ite .cse2 0 v_~z$w_buff0_used~0_132) v_~z$w_buff0_used~0_131) (= v_~z$r_buff0_thd1~0_28 (ite .cse1 0 v_~z$r_buff0_thd1~0_29))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_117, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_71, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_116, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_70, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][150], [51#L3true, 42#L765true, P0Thread1of1ForFork0InUse, 124#true, 140#true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 97#L798true, 174#(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)), 92#L778true, 121#true]) [2022-12-11 23:35:01,149 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-12-11 23:35:01,149 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-11 23:35:01,149 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-11 23:35:01,149 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-11 23:35:01,149 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][149], [51#L3true, 42#L765true, 124#true, 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 16#L814true, 174#(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)), 92#L778true, 121#true]) [2022-12-11 23:35:01,149 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-11 23:35:01,149 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 23:35:01,149 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 23:35:01,149 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 23:35:01,152 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_113 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd2~0_23 (ite .cse0 0 v_~z$r_buff0_thd2~0_24)) (= v_~z$w_buff0_used~0_127 (ite .cse1 0 v_~z$w_buff0_used~0_128)) (= v_~z$w_buff1_used~0_112 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_113)) (= v_~z~0_66 (ite .cse1 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_48 v_~z~0_67))) (= v_~z$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_112 256)))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_23 256) 0)))) 0 v_~z$r_buff1_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_24} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_66, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_23} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][209], [111#L785true, 124#true, 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 50#L758true, 109#L3-1true, 97#L798true, 174#(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]) [2022-12-11 23:35:01,152 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-11 23:35:01,152 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 23:35:01,152 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 23:35:01,152 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 23:35:01,189 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_113 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd2~0_23 (ite .cse0 0 v_~z$r_buff0_thd2~0_24)) (= v_~z$w_buff0_used~0_127 (ite .cse1 0 v_~z$w_buff0_used~0_128)) (= v_~z$w_buff1_used~0_112 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_113)) (= v_~z~0_66 (ite .cse1 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_48 v_~z~0_67))) (= v_~z$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_112 256)))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_23 256) 0)))) 0 v_~z$r_buff1_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_24} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_66, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_23} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][209], [111#L785true, 51#L3true, 42#L765true, 124#true, 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 97#L798true, 174#(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]) [2022-12-11 23:35:01,189 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is not cut-off event [2022-12-11 23:35:01,189 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-12-11 23:35:01,189 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-12-11 23:35:01,190 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-12-11 23:35:01,200 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L758-->L765: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_131 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff1_used~0_117 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_132 256) 0)))) (.cse1 (and .cse5 .cse4))) (and (= v_~z$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_117)) (= (ite .cse2 v_~z$w_buff0~0_49 (ite .cse0 v_~z$w_buff1~0_50 v_~z~0_71)) v_~z~0_70) (= v_~z$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_116 256) 0))) (and (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_20)) (= (ite .cse2 0 v_~z$w_buff0_used~0_132) v_~z$w_buff0_used~0_131) (= v_~z$r_buff0_thd1~0_28 (ite .cse1 0 v_~z$r_buff0_thd1~0_29))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_117, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_71, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_116, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_70, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][150], [42#L765true, 124#true, 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 109#L3-1true, 97#L798true, 174#(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)), 92#L778true, 121#true]) [2022-12-11 23:35:01,201 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is not cut-off event [2022-12-11 23:35:01,201 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-12-11 23:35:01,201 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-12-11 23:35:01,201 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-12-11 23:35:01,201 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][149], [42#L765true, 124#true, 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 16#L814true, 109#L3-1true, 174#(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)), 92#L778true, 121#true]) [2022-12-11 23:35:01,201 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-11 23:35:01,201 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:35:01,201 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:35:01,201 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:35:01,202 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][201], [51#L3true, 124#true, 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 16#L814true, 71#L768true, 92#L778true, 121#true, 178#(and (<= |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))]) [2022-12-11 23:35:01,202 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-11 23:35:01,202 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:35:01,202 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:35:01,202 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:35:01,203 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_113 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd2~0_23 (ite .cse0 0 v_~z$r_buff0_thd2~0_24)) (= v_~z$w_buff0_used~0_127 (ite .cse1 0 v_~z$w_buff0_used~0_128)) (= v_~z$w_buff1_used~0_112 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_113)) (= v_~z~0_66 (ite .cse1 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_48 v_~z~0_67))) (= v_~z$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_112 256)))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_23 256) 0)))) 0 v_~z$r_buff1_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_24} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_66, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_23} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][247], [111#L785true, 51#L3true, 124#true, 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 71#L768true, 97#L798true, 121#true, 178#(and (<= |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))]) [2022-12-11 23:35:01,203 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-11 23:35:01,203 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:35:01,203 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:35:01,203 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:35:01,239 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_113 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd2~0_23 (ite .cse0 0 v_~z$r_buff0_thd2~0_24)) (= v_~z$w_buff0_used~0_127 (ite .cse1 0 v_~z$w_buff0_used~0_128)) (= v_~z$w_buff1_used~0_112 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_113)) (= v_~z~0_66 (ite .cse1 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_48 v_~z~0_67))) (= v_~z$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_112 256)))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_23 256) 0)))) 0 v_~z$r_buff1_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_24} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_66, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_23} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][209], [111#L785true, 42#L765true, 124#true, 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 109#L3-1true, 97#L798true, 174#(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]) [2022-12-11 23:35:01,239 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is not cut-off event [2022-12-11 23:35:01,239 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is not cut-off event [2022-12-11 23:35:01,239 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is not cut-off event [2022-12-11 23:35:01,239 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is not cut-off event [2022-12-11 23:35:01,249 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][201], [P0Thread1of1ForFork0InUse, 124#true, 140#true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 16#L814true, 71#L768true, 109#L3-1true, 92#L778true, 121#true, 178#(and (<= |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))]) [2022-12-11 23:35:01,249 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-11 23:35:01,249 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-11 23:35:01,249 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-11 23:35:01,249 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-11 23:35:01,250 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_113 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd2~0_23 (ite .cse0 0 v_~z$r_buff0_thd2~0_24)) (= v_~z$w_buff0_used~0_127 (ite .cse1 0 v_~z$w_buff0_used~0_128)) (= v_~z$w_buff1_used~0_112 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_113)) (= v_~z~0_66 (ite .cse1 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_48 v_~z~0_67))) (= v_~z$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_112 256)))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_23 256) 0)))) 0 v_~z$r_buff1_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_24} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_66, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_23} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][247], [111#L785true, 124#true, 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 71#L768true, 109#L3-1true, 97#L798true, 121#true, 178#(and (<= |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))]) [2022-12-11 23:35:01,250 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-11 23:35:01,250 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-11 23:35:01,250 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-11 23:35:01,250 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-11 23:35:01,448 INFO L130 PetriNetUnfolder]: 3506/6320 cut-off events. [2022-12-11 23:35:01,448 INFO L131 PetriNetUnfolder]: For 12986/15143 co-relation queries the response was YES. [2022-12-11 23:35:01,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20322 conditions, 6320 events. 3506/6320 cut-off events. For 12986/15143 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 46253 event pairs, 110 based on Foata normal form. 117/6112 useless extension candidates. Maximal degree in co-relation 20257. Up to 3098 conditions per place. [2022-12-11 23:35:01,478 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 135 selfloop transitions, 13 changer transitions 72/302 dead transitions. [2022-12-11 23:35:01,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 302 transitions, 2233 flow [2022-12-11 23:35:01,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:35:01,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:35:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 949 transitions. [2022-12-11 23:35:01,480 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8627272727272727 [2022-12-11 23:35:01,482 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 4 predicate places. [2022-12-11 23:35:01,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 302 transitions, 2233 flow [2022-12-11 23:35:01,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 230 transitions, 1573 flow [2022-12-11 23:35:01,500 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 230 transitions, 1573 flow [2022-12-11 23:35:01,500 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-11 23:35:01,500 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:35:01,500 INFO L214 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-11 23:35:01,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 23:35:01,501 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:35:01,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:35:01,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1690161718, now seen corresponding path program 1 times [2022-12-11 23:35:01,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:35:01,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608215112] [2022-12-11 23:35:01,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:35:01,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:35:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:35:01,717 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-11 23:35:01,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:35:01,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608215112] [2022-12-11 23:35:01,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608215112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:35:01,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:35:01,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:35:01,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125236380] [2022-12-11 23:35:01,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:35:01,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:35:01,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:35:01,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:35:01,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:35:01,719 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 110 [2022-12-11 23:35:01,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 230 transitions, 1573 flow. Second operand has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:35:01,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:35:01,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 110 [2022-12-11 23:35:01,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:35:02,367 INFO L130 PetriNetUnfolder]: 1751/3945 cut-off events. [2022-12-11 23:35:02,367 INFO L131 PetriNetUnfolder]: For 7562/10071 co-relation queries the response was YES. [2022-12-11 23:35:02,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14614 conditions, 3945 events. 1751/3945 cut-off events. For 7562/10071 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 33353 event pairs, 73 based on Foata normal form. 465/4268 useless extension candidates. Maximal degree in co-relation 14545. Up to 1518 conditions per place. [2022-12-11 23:35:02,385 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 161 selfloop transitions, 24 changer transitions 108/375 dead transitions. [2022-12-11 23:35:02,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 375 transitions, 3372 flow [2022-12-11 23:35:02,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:35:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:35:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1228 transitions. [2022-12-11 23:35:02,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8587412587412587 [2022-12-11 23:35:02,390 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 16 predicate places. [2022-12-11 23:35:02,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 375 transitions, 3372 flow [2022-12-11 23:35:02,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 267 transitions, 2250 flow [2022-12-11 23:35:02,399 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 267 transitions, 2250 flow [2022-12-11 23:35:02,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:35:02,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:35:02,400 INFO L214 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-11 23:35:02,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 23:35:02,401 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:35:02,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:35:02,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1836705985, now seen corresponding path program 1 times [2022-12-11 23:35:02,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:35:02,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736573284] [2022-12-11 23:35:02,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:35:02,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:35:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:35:02,963 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-11 23:35:02,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:35:02,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736573284] [2022-12-11 23:35:02,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736573284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:35:02,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:35:02,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 23:35:02,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979263161] [2022-12-11 23:35:02,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:35:02,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 23:35:02,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:35:02,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 23:35:02,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-11 23:35:02,966 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 110 [2022-12-11 23:35:02,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 267 transitions, 2250 flow. Second operand has 9 states, 9 states have (on average 79.88888888888889) internal successors, (719), 9 states have internal predecessors, (719), 0 states have call successors, (0), 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-11 23:35:02,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:35:02,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 110 [2022-12-11 23:35:02,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:35:03,725 INFO L130 PetriNetUnfolder]: 1739/5080 cut-off events. [2022-12-11 23:35:03,726 INFO L131 PetriNetUnfolder]: For 11671/14309 co-relation queries the response was YES. [2022-12-11 23:35:03,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18853 conditions, 5080 events. 1739/5080 cut-off events. For 11671/14309 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 51322 event pairs, 83 based on Foata normal form. 237/5214 useless extension candidates. Maximal degree in co-relation 18772. Up to 1648 conditions per place. [2022-12-11 23:35:03,744 INFO L137 encePairwiseOnDemand]: 92/110 looper letters, 150 selfloop transitions, 140 changer transitions 101/487 dead transitions. [2022-12-11 23:35:03,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 487 transitions, 5374 flow [2022-12-11 23:35:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 23:35:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 23:35:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1049 transitions. [2022-12-11 23:35:03,746 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7946969696969697 [2022-12-11 23:35:03,747 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 25 predicate places. [2022-12-11 23:35:03,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 487 transitions, 5374 flow [2022-12-11 23:35:03,759 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 386 transitions, 4032 flow [2022-12-11 23:35:03,759 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 386 transitions, 4032 flow [2022-12-11 23:35:03,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 79.88888888888889) internal successors, (719), 9 states have internal predecessors, (719), 0 states have call successors, (0), 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-11 23:35:03,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:35:03,760 INFO L214 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-11 23:35:03,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 23:35:03,760 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:35:03,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:35:03,760 INFO L85 PathProgramCache]: Analyzing trace with hash 274067295, now seen corresponding path program 2 times [2022-12-11 23:35:03,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:35:03,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560939093] [2022-12-11 23:35:03,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:35:03,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:35:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:35:03,934 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-11 23:35:03,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:35:03,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560939093] [2022-12-11 23:35:03,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560939093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:35:03,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:35:03,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:35:03,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858191551] [2022-12-11 23:35:03,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:35:03,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:35:03,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:35:03,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:35:03,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:35:03,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 110 [2022-12-11 23:35:03,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 386 transitions, 4032 flow. Second operand has 8 states, 8 states have (on average 88.125) internal successors, (705), 8 states have internal predecessors, (705), 0 states have call successors, (0), 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-11 23:35:03,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:35:03,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 110 [2022-12-11 23:35:03,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:35:04,642 INFO L130 PetriNetUnfolder]: 1295/4009 cut-off events. [2022-12-11 23:35:04,642 INFO L131 PetriNetUnfolder]: For 9577/11701 co-relation queries the response was YES. [2022-12-11 23:35:04,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17318 conditions, 4009 events. 1295/4009 cut-off events. For 9577/11701 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 40756 event pairs, 77 based on Foata normal form. 332/4285 useless extension candidates. Maximal degree in co-relation 17233. Up to 1164 conditions per place. [2022-12-11 23:35:04,655 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 215 selfloop transitions, 28 changer transitions 47/397 dead transitions. [2022-12-11 23:35:04,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 397 transitions, 4760 flow [2022-12-11 23:35:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 23:35:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 23:35:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1464 transitions. [2022-12-11 23:35:04,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8318181818181818 [2022-12-11 23:35:04,659 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 37 predicate places. [2022-12-11 23:35:04,659 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 397 transitions, 4760 flow [2022-12-11 23:35:04,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 350 transitions, 4117 flow [2022-12-11 23:35:04,667 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 350 transitions, 4117 flow [2022-12-11 23:35:04,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.125) internal successors, (705), 8 states have internal predecessors, (705), 0 states have call successors, (0), 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-11 23:35:04,668 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:35:04,668 INFO L214 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, 1, 1, 1] [2022-12-11 23:35:04,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 23:35:04,668 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:35:04,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:35:04,669 INFO L85 PathProgramCache]: Analyzing trace with hash -885168238, now seen corresponding path program 1 times [2022-12-11 23:35:04,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:35:04,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554520365] [2022-12-11 23:35:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:35:04,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:35:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:35:05,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-11 23:35:05,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:35:05,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554520365] [2022-12-11 23:35:05,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554520365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:35:05,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:35:05,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 23:35:05,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696541432] [2022-12-11 23:35:05,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:35:05,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 23:35:05,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:35:05,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 23:35:05,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-11 23:35:05,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 110 [2022-12-11 23:35:05,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 350 transitions, 4117 flow. Second operand has 11 states, 11 states have (on average 76.81818181818181) internal successors, (845), 11 states have internal predecessors, (845), 0 states have call successors, (0), 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-11 23:35:05,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:35:05,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 110 [2022-12-11 23:35:05,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:35:05,997 INFO L130 PetriNetUnfolder]: 1265/4156 cut-off events. [2022-12-11 23:35:05,997 INFO L131 PetriNetUnfolder]: For 12830/17070 co-relation queries the response was YES. [2022-12-11 23:35:06,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18747 conditions, 4156 events. 1265/4156 cut-off events. For 12830/17070 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 43410 event pairs, 74 based on Foata normal form. 255/4360 useless extension candidates. Maximal degree in co-relation 18647. Up to 1171 conditions per place. [2022-12-11 23:35:06,011 INFO L137 encePairwiseOnDemand]: 93/110 looper letters, 140 selfloop transitions, 84 changer transitions 89/407 dead transitions. [2022-12-11 23:35:06,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 407 transitions, 5595 flow [2022-12-11 23:35:06,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:35:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:35:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1037 transitions. [2022-12-11 23:35:06,014 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7251748251748251 [2022-12-11 23:35:06,014 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 46 predicate places. [2022-12-11 23:35:06,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 407 transitions, 5595 flow [2022-12-11 23:35:06,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 318 transitions, 4087 flow [2022-12-11 23:35:06,023 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 318 transitions, 4087 flow [2022-12-11 23:35:06,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 76.81818181818181) internal successors, (845), 11 states have internal predecessors, (845), 0 states have call successors, (0), 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-11 23:35:06,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:35:06,024 INFO L214 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, 1, 1, 1] [2022-12-11 23:35:06,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 23:35:06,024 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:35:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:35:06,024 INFO L85 PathProgramCache]: Analyzing trace with hash 104615138, now seen corresponding path program 2 times [2022-12-11 23:35:06,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:35:06,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164155942] [2022-12-11 23:35:06,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:35:06,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:35:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:35:06,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 23:35:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:35:06,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 23:35:06,134 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 23:35:06,135 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 23:35:06,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 23:35:06,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 23:35:06,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 23:35:06,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 23:35:06,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 23:35:06,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 23:35:06,137 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2022-12-11 23:35:06,142 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 23:35:06,142 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 23:35:06,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 11:35:06 BasicIcfg [2022-12-11 23:35:06,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 23:35:06,233 INFO L158 Benchmark]: Toolchain (without parser) took 9329.97ms. Allocated memory was 198.2MB in the beginning and 554.7MB in the end (delta: 356.5MB). Free memory was 171.8MB in the beginning and 350.4MB in the end (delta: -178.6MB). Peak memory consumption was 178.4MB. Max. memory is 8.0GB. [2022-12-11 23:35:06,233 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory was 174.1MB in the beginning and 174.0MB in the end (delta: 91.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:35:06,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.89ms. Allocated memory is still 198.2MB. Free memory was 171.3MB in the beginning and 145.0MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-11 23:35:06,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.51ms. Allocated memory is still 198.2MB. Free memory was 145.0MB in the beginning and 142.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 23:35:06,237 INFO L158 Benchmark]: Boogie Preprocessor took 40.60ms. Allocated memory is still 198.2MB. Free memory was 142.4MB in the beginning and 140.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 23:35:06,237 INFO L158 Benchmark]: RCFGBuilder took 512.31ms. Allocated memory is still 198.2MB. Free memory was 140.8MB in the beginning and 106.7MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-11 23:35:06,237 INFO L158 Benchmark]: TraceAbstraction took 8294.93ms. Allocated memory was 198.2MB in the beginning and 554.7MB in the end (delta: 356.5MB). Free memory was 105.1MB in the beginning and 350.4MB in the end (delta: -245.3MB). Peak memory consumption was 112.3MB. Max. memory is 8.0GB. [2022-12-11 23:35:06,238 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 was 174.1MB in the beginning and 174.0MB in the end (delta: 91.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 422.89ms. Allocated memory is still 198.2MB. Free memory was 171.3MB in the beginning and 145.0MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.51ms. Allocated memory is still 198.2MB. Free memory was 145.0MB in the beginning and 142.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.60ms. Allocated memory is still 198.2MB. Free memory was 142.4MB in the beginning and 140.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 512.31ms. Allocated memory is still 198.2MB. Free memory was 140.8MB in the beginning and 106.7MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8294.93ms. Allocated memory was 198.2MB in the beginning and 554.7MB in the end (delta: 356.5MB). Free memory was 105.1MB in the beginning and 350.4MB in the end (delta: -245.3MB). Peak memory consumption was 112.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L724] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L725] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L726] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L727] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L728] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L729] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L730] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L731] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L732] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L733] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L734] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L735] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L736] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L737] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L738] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L739] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t657; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t657, ((void *)0), P0, ((void *)0))=-2, t657={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t658; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t658, ((void *)0), P1, ((void *)0))=-1, t657={5:0}, t658={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t659; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t659, ((void *)0), P2, ((void *)0))=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 843]: 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: 841]: 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, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 675 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 675 mSDsluCounter, 624 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 500 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1300 IncrementalHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 124 mSDtfsCounter, 1300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4117occurred in iteration=7, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 6227 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 668 NumberOfCodeBlocks, 668 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 574 ConstructedInterpolants, 0 QuantifiedInterpolants, 2562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-11 23:35:06,256 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...