/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:32:59,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:32:59,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:32:59,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:32:59,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:32:59,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:32:59,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:32:59,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:32:59,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:32:59,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:32:59,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:32:59,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:32:59,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:32:59,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:32:59,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:32:59,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:32:59,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:32:59,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:32:59,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:32:59,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:32:59,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:32:59,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:32:59,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:32:59,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:32:59,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:32:59,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:32:59,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:32:59,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:32:59,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:32:59,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:32:59,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:32:59,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:32:59,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:32:59,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:32:59,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:32:59,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:32:59,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:32:59,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:32:59,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:32:59,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:32:59,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:32:59,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-06 16:32:59,460 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:32:59,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:32:59,461 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:32:59,461 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:32:59,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:32:59,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:32:59,462 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:32:59,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:32:59,462 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:32:59,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:32:59,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:32:59,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:32:59,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:32:59,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:32:59,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:32:59,463 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:32:59,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:32:59,463 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:32:59,464 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:32:59,464 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:32:59,464 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:32:59,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:32:59,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:32:59,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:32:59,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:32:59,465 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:32:59,465 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:32:59,465 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:32:59,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:32:59,465 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:32:59,465 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:32:59,465 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 16:32:59,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:32:59,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:32:59,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:32:59,710 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:32:59,711 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:32:59,712 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 16:33:00,641 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:33:00,833 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:33:00,833 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 16:33:00,843 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebf0a048a/1a335d562a8846edb7b572a35fb5ced5/FLAG113beb392 [2022-12-06 16:33:00,852 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebf0a048a/1a335d562a8846edb7b572a35fb5ced5 [2022-12-06 16:33:00,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:33:00,857 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:33:00,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:33:00,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:33:00,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:33:00,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:33:00" (1/1) ... [2022-12-06 16:33:00,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e21f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:00, skipping insertion in model container [2022-12-06 16:33:00,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:33:00" (1/1) ... [2022-12-06 16:33:00,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:33:00,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:33:01,007 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/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-06 16:33:01,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:33:01,196 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:33:01,204 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/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-06 16:33:01,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:33:01,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:33:01,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:33:01,287 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:33:01,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:01 WrapperNode [2022-12-06 16:33:01,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:33:01,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:33:01,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:33:01,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:33:01,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:01" (1/1) ... [2022-12-06 16:33:01,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:01" (1/1) ... [2022-12-06 16:33:01,350 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 157 [2022-12-06 16:33:01,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:33:01,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:33:01,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:33:01,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:33:01,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:01" (1/1) ... [2022-12-06 16:33:01,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:01" (1/1) ... [2022-12-06 16:33:01,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:01" (1/1) ... [2022-12-06 16:33:01,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:01" (1/1) ... [2022-12-06 16:33:01,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:01" (1/1) ... [2022-12-06 16:33:01,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:01" (1/1) ... [2022-12-06 16:33:01,379 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:01" (1/1) ... [2022-12-06 16:33:01,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:01" (1/1) ... [2022-12-06 16:33:01,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:33:01,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:33:01,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:33:01,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:33:01,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:01" (1/1) ... [2022-12-06 16:33:01,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:33:01,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:33:01,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 16:33:01,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 16:33:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:33:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:33:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:33:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:33:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:33:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 16:33:01,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 16:33:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 16:33:01,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 16:33:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 16:33:01,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 16:33:01,470 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 16:33:01,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 16:33:01,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:33:01,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:33:01,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:33:01,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:33:01,471 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 16:33:01,595 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:33:01,596 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:33:01,863 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:33:01,951 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:33:01,953 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:33:01,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:33:01 BoogieIcfgContainer [2022-12-06 16:33:01,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:33:01,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:33:01,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:33:01,960 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:33:01,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:33:00" (1/3) ... [2022-12-06 16:33:01,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4f5448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:33:01, skipping insertion in model container [2022-12-06 16:33:01,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:01" (2/3) ... [2022-12-06 16:33:01,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4f5448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:33:01, skipping insertion in model container [2022-12-06 16:33:01,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:33:01" (3/3) ... [2022-12-06 16:33:01,964 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 16:33:01,975 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:33:01,976 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:33:01,976 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:33:02,013 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:33:02,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 270 flow [2022-12-06 16:33:02,071 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-06 16:33:02,072 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:33:02,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-06 16:33:02,076 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 125 transitions, 270 flow [2022-12-06 16:33:02,079 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 121 transitions, 254 flow [2022-12-06 16:33:02,085 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:33:02,089 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;@420b666f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:33:02,090 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 16:33:02,105 INFO L130 PetriNetUnfolder]: 0/85 cut-off events. [2022-12-06 16:33:02,106 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:33:02,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:33:02,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:33:02,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:33:02,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:33:02,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1506689710, now seen corresponding path program 1 times [2022-12-06 16:33:02,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:33:02,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336330268] [2022-12-06 16:33:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:33:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:33:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:33:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:33:02,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:33:02,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336330268] [2022-12-06 16:33:02,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336330268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:33:02,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:33:02,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:33:02,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105950434] [2022-12-06 16:33:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:33:02,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:33:02,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:33:02,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:33:02,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:33:02,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 125 [2022-12-06 16:33:02,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 121 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:02,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:33:02,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 125 [2022-12-06 16:33:02,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:33:02,679 INFO L130 PetriNetUnfolder]: 17/248 cut-off events. [2022-12-06 16:33:02,679 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 16:33:02,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 248 events. 17/248 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 747 event pairs, 7 based on Foata normal form. 9/245 useless extension candidates. Maximal degree in co-relation 252. Up to 27 conditions per place. [2022-12-06 16:33:02,682 INFO L137 encePairwiseOnDemand]: 120/125 looper letters, 11 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2022-12-06 16:33:02,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 120 transitions, 278 flow [2022-12-06 16:33:02,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:33:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:33:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2022-12-06 16:33:02,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.936 [2022-12-06 16:33:02,704 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 0 predicate places. [2022-12-06 16:33:02,705 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 120 transitions, 278 flow [2022-12-06 16:33:02,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:02,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:33:02,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:33:02,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:33:02,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:33:02,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:33:02,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1266799691, now seen corresponding path program 1 times [2022-12-06 16:33:02,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:33:02,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396571273] [2022-12-06 16:33:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:33:02,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:33:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:33:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:33:03,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:33:03,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396571273] [2022-12-06 16:33:03,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396571273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:33:03,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:33:03,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:33:03,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410259326] [2022-12-06 16:33:03,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:33:03,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:33:03,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:33:03,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:33:03,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:33:03,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 125 [2022-12-06 16:33:03,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 120 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:03,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:33:03,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 125 [2022-12-06 16:33:03,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:33:05,145 INFO L130 PetriNetUnfolder]: 4296/10647 cut-off events. [2022-12-06 16:33:05,146 INFO L131 PetriNetUnfolder]: For 1527/2395 co-relation queries the response was YES. [2022-12-06 16:33:05,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18733 conditions, 10647 events. 4296/10647 cut-off events. For 1527/2395 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 105471 event pairs, 412 based on Foata normal form. 3/10406 useless extension candidates. Maximal degree in co-relation 18668. Up to 2396 conditions per place. [2022-12-06 16:33:05,210 INFO L137 encePairwiseOnDemand]: 110/125 looper letters, 46 selfloop transitions, 15 changer transitions 110/246 dead transitions. [2022-12-06 16:33:05,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 246 transitions, 953 flow [2022-12-06 16:33:05,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:33:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:33:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1319 transitions. [2022-12-06 16:33:05,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8116923076923077 [2022-12-06 16:33:05,215 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 12 predicate places. [2022-12-06 16:33:05,215 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 246 transitions, 953 flow [2022-12-06 16:33:05,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:05,215 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:33:05,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:33:05,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:33:05,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:33:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:33:05,218 INFO L85 PathProgramCache]: Analyzing trace with hash -484791114, now seen corresponding path program 1 times [2022-12-06 16:33:05,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:33:05,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442641344] [2022-12-06 16:33:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:33:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:33:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:33:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:33:05,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:33:05,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442641344] [2022-12-06 16:33:05,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442641344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:33:05,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:33:05,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:33:05,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041244549] [2022-12-06 16:33:05,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:33:05,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:33:05,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:33:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:33:05,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:33:05,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 125 [2022-12-06 16:33:05,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 246 transitions, 953 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:05,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:33:05,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 125 [2022-12-06 16:33:05,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:33:07,608 INFO L130 PetriNetUnfolder]: 6657/17469 cut-off events. [2022-12-06 16:33:07,608 INFO L131 PetriNetUnfolder]: For 2834/10063 co-relation queries the response was YES. [2022-12-06 16:33:07,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39537 conditions, 17469 events. 6657/17469 cut-off events. For 2834/10063 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 195185 event pairs, 335 based on Foata normal form. 49/17266 useless extension candidates. Maximal degree in co-relation 39459. Up to 3319 conditions per place. [2022-12-06 16:33:07,670 INFO L137 encePairwiseOnDemand]: 111/125 looper letters, 68 selfloop transitions, 25 changer transitions 387/555 dead transitions. [2022-12-06 16:33:07,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 555 transitions, 3389 flow [2022-12-06 16:33:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:33:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:33:07,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1325 transitions. [2022-12-06 16:33:07,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8153846153846154 [2022-12-06 16:33:07,674 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 24 predicate places. [2022-12-06 16:33:07,674 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 555 transitions, 3389 flow [2022-12-06 16:33:07,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:07,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:33:07,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:33:07,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:33:07,675 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:33:07,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:33:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1780250872, now seen corresponding path program 1 times [2022-12-06 16:33:07,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:33:07,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745067811] [2022-12-06 16:33:07,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:33:07,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:33:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:33:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:33:08,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:33:08,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745067811] [2022-12-06 16:33:08,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745067811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:33:08,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:33:08,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:33:08,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297484664] [2022-12-06 16:33:08,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:33:08,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:33:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:33:08,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:33:08,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:33:08,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 125 [2022-12-06 16:33:08,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 555 transitions, 3389 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:08,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:33:08,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 125 [2022-12-06 16:33:08,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:33:10,787 INFO L130 PetriNetUnfolder]: 9569/26874 cut-off events. [2022-12-06 16:33:10,788 INFO L131 PetriNetUnfolder]: For 4836/33082 co-relation queries the response was YES. [2022-12-06 16:33:10,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73898 conditions, 26874 events. 9569/26874 cut-off events. For 4836/33082 co-relation queries the response was YES. Maximal size of possible extension queue 1769. Compared 337486 event pairs, 319 based on Foata normal form. 83/26693 useless extension candidates. Maximal degree in co-relation 73807. Up to 5311 conditions per place. [2022-12-06 16:33:10,864 INFO L137 encePairwiseOnDemand]: 110/125 looper letters, 90 selfloop transitions, 27 changer transitions 784/976 dead transitions. [2022-12-06 16:33:10,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 976 transitions, 8073 flow [2022-12-06 16:33:10,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:33:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:33:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1322 transitions. [2022-12-06 16:33:10,868 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8135384615384615 [2022-12-06 16:33:10,868 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 36 predicate places. [2022-12-06 16:33:10,868 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 976 transitions, 8073 flow [2022-12-06 16:33:10,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:10,869 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:33:10,869 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:33:10,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:33:10,869 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:33:10,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:33:10,870 INFO L85 PathProgramCache]: Analyzing trace with hash -980559585, now seen corresponding path program 1 times [2022-12-06 16:33:10,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:33:10,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175553867] [2022-12-06 16:33:10,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:33:10,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:33:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:33:11,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:33:11,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:33:11,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175553867] [2022-12-06 16:33:11,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175553867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:33:11,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:33:11,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 16:33:11,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019827568] [2022-12-06 16:33:11,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:33:11,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 16:33:11,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:33:11,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 16:33:11,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 16:33:11,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 125 [2022-12-06 16:33:11,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 976 transitions, 8073 flow. Second operand has 10 states, 10 states have (on average 102.5) internal successors, (1025), 10 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:11,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:33:11,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 125 [2022-12-06 16:33:11,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:33:15,040 INFO L130 PetriNetUnfolder]: 12480/35339 cut-off events. [2022-12-06 16:33:15,040 INFO L131 PetriNetUnfolder]: For 14342/58626 co-relation queries the response was YES. [2022-12-06 16:33:15,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109597 conditions, 35339 events. 12480/35339 cut-off events. For 14342/58626 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 466477 event pairs, 202 based on Foata normal form. 48/35171 useless extension candidates. Maximal degree in co-relation 109499. Up to 6854 conditions per place. [2022-12-06 16:33:15,216 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 85 selfloop transitions, 26 changer transitions 1722/1943 dead transitions. [2022-12-06 16:33:15,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 1943 transitions, 19669 flow [2022-12-06 16:33:15,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:33:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:33:15,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1684 transitions. [2022-12-06 16:33:15,220 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.842 [2022-12-06 16:33:15,223 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 51 predicate places. [2022-12-06 16:33:15,223 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 1943 transitions, 19669 flow [2022-12-06 16:33:15,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 102.5) internal successors, (1025), 10 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:15,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:33:15,224 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:33:15,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:33:15,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:33:15,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:33:15,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2033519761, now seen corresponding path program 1 times [2022-12-06 16:33:15,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:33:15,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269246748] [2022-12-06 16:33:15,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:33:15,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:33:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:33:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:33:15,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:33:15,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269246748] [2022-12-06 16:33:15,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269246748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:33:15,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:33:15,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:33:15,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027252951] [2022-12-06 16:33:15,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:33:15,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:33:15,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:33:15,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:33:15,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:33:15,703 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 125 [2022-12-06 16:33:15,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 1943 transitions, 19669 flow. Second operand has 8 states, 8 states have (on average 104.75) internal successors, (838), 8 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:15,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:33:15,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 125 [2022-12-06 16:33:15,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:33:20,977 INFO L130 PetriNetUnfolder]: 14602/42142 cut-off events. [2022-12-06 16:33:20,978 INFO L131 PetriNetUnfolder]: For 25539/36492 co-relation queries the response was YES. [2022-12-06 16:33:21,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143560 conditions, 42142 events. 14602/42142 cut-off events. For 25539/36492 co-relation queries the response was YES. Maximal size of possible extension queue 2825. Compared 575855 event pairs, 241 based on Foata normal form. 190/42126 useless extension candidates. Maximal degree in co-relation 143457. Up to 9954 conditions per place. [2022-12-06 16:33:21,176 INFO L137 encePairwiseOnDemand]: 116/125 looper letters, 111 selfloop transitions, 26 changer transitions 2390/2639 dead transitions. [2022-12-06 16:33:21,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 2639 transitions, 31689 flow [2022-12-06 16:33:21,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:33:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:33:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1405 transitions. [2022-12-06 16:33:21,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8646153846153846 [2022-12-06 16:33:21,180 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 63 predicate places. [2022-12-06 16:33:21,180 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 2639 transitions, 31689 flow [2022-12-06 16:33:21,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.75) internal successors, (838), 8 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:21,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:33:21,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:33:21,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:33:21,181 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:33:21,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:33:21,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1590232325, now seen corresponding path program 2 times [2022-12-06 16:33:21,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:33:21,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889538103] [2022-12-06 16:33:21,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:33:21,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:33:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:33:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:33:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:33:21,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889538103] [2022-12-06 16:33:21,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889538103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:33:21,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:33:21,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 16:33:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311897631] [2022-12-06 16:33:21,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:33:21,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 16:33:21,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:33:21,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 16:33:21,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 16:33:21,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 125 [2022-12-06 16:33:21,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 2639 transitions, 31689 flow. Second operand has 9 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:21,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:33:21,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 125 [2022-12-06 16:33:21,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:33:30,867 INFO L130 PetriNetUnfolder]: 17528/53682 cut-off events. [2022-12-06 16:33:30,868 INFO L131 PetriNetUnfolder]: For 31365/50978 co-relation queries the response was YES. [2022-12-06 16:33:31,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203709 conditions, 53682 events. 17528/53682 cut-off events. For 31365/50978 co-relation queries the response was YES. Maximal size of possible extension queue 3762. Compared 782031 event pairs, 330 based on Foata normal form. 566/54056 useless extension candidates. Maximal degree in co-relation 203593. Up to 12749 conditions per place. [2022-12-06 16:33:31,093 INFO L137 encePairwiseOnDemand]: 107/125 looper letters, 128 selfloop transitions, 76 changer transitions 3584/3863 dead transitions. [2022-12-06 16:33:31,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 3863 transitions, 52429 flow [2022-12-06 16:33:31,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 16:33:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 16:33:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2190 transitions. [2022-12-06 16:33:31,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7963636363636364 [2022-12-06 16:33:31,099 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 84 predicate places. [2022-12-06 16:33:31,099 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 3863 transitions, 52429 flow [2022-12-06 16:33:31,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:31,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:33:31,099 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:33:31,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:33:31,100 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:33:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:33:31,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2068385450, now seen corresponding path program 1 times [2022-12-06 16:33:31,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:33:31,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494364420] [2022-12-06 16:33:31,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:33:31,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:33:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:33:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:33:31,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:33:31,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494364420] [2022-12-06 16:33:31,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494364420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:33:31,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:33:31,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 16:33:31,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641471273] [2022-12-06 16:33:31,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:33:31,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 16:33:31,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:33:31,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 16:33:31,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-06 16:33:31,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2022-12-06 16:33:31,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 3863 transitions, 52429 flow. Second operand has 12 states, 12 states have (on average 101.5) internal successors, (1218), 12 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:31,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:33:31,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2022-12-06 16:33:31,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:33:43,440 INFO L130 PetriNetUnfolder]: 19057/61171 cut-off events. [2022-12-06 16:33:43,440 INFO L131 PetriNetUnfolder]: For 49623/71317 co-relation queries the response was YES. [2022-12-06 16:33:43,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247544 conditions, 61171 events. 19057/61171 cut-off events. For 49623/71317 co-relation queries the response was YES. Maximal size of possible extension queue 4376. Compared 927706 event pairs, 220 based on Foata normal form. 171/61165 useless extension candidates. Maximal degree in co-relation 247420. Up to 14771 conditions per place. [2022-12-06 16:33:43,695 INFO L137 encePairwiseOnDemand]: 115/125 looper letters, 129 selfloop transitions, 17 changer transitions 4365/4647 dead transitions. [2022-12-06 16:33:43,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 4647 transitions, 71489 flow [2022-12-06 16:33:43,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:33:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:33:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1354 transitions. [2022-12-06 16:33:43,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8332307692307692 [2022-12-06 16:33:43,699 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 96 predicate places. [2022-12-06 16:33:43,699 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 4647 transitions, 71489 flow [2022-12-06 16:33:43,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 101.5) internal successors, (1218), 12 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:43,699 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:33:43,700 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:33:43,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 16:33:43,700 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:33:43,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:33:43,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1139782344, now seen corresponding path program 1 times [2022-12-06 16:33:43,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:33:43,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140235999] [2022-12-06 16:33:43,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:33:43,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:33:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:33:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:33:43,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:33:43,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140235999] [2022-12-06 16:33:43,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140235999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:33:43,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:33:43,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:33:43,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622161504] [2022-12-06 16:33:43,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:33:43,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:33:43,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:33:43,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:33:43,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:33:43,862 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2022-12-06 16:33:43,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 4647 transitions, 71489 flow. Second operand has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:33:43,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:33:43,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2022-12-06 16:33:43,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:34:20,508 INFO L130 PetriNetUnfolder]: 41621/108051 cut-off events. [2022-12-06 16:34:20,508 INFO L131 PetriNetUnfolder]: For 423604/454482 co-relation queries the response was YES. [2022-12-06 16:34:21,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435553 conditions, 108051 events. 41621/108051 cut-off events. For 423604/454482 co-relation queries the response was YES. Maximal size of possible extension queue 6079. Compared 1550291 event pairs, 4283 based on Foata normal form. 2685/106784 useless extension candidates. Maximal degree in co-relation 435425. Up to 34563 conditions per place. [2022-12-06 16:34:21,152 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 389 selfloop transitions, 20 changer transitions 2896/3508 dead transitions. [2022-12-06 16:34:21,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 3508 transitions, 57348 flow [2022-12-06 16:34:21,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:34:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:34:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1084 transitions. [2022-12-06 16:34:21,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8672 [2022-12-06 16:34:21,155 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 105 predicate places. [2022-12-06 16:34:21,155 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 3508 transitions, 57348 flow [2022-12-06 16:34:21,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:34:21,156 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:34:21,156 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:34:21,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 16:34:21,156 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:34:21,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:34:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash 445272736, now seen corresponding path program 1 times [2022-12-06 16:34:21,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:34:21,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101734054] [2022-12-06 16:34:21,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:34:21,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:34:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:34:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:34:21,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:34:21,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101734054] [2022-12-06 16:34:21,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101734054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:34:21,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:34:21,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:34:21,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829166721] [2022-12-06 16:34:21,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:34:21,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:34:21,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:34:21,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:34:21,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:34:21,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2022-12-06 16:34:21,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 3508 transitions, 57348 flow. Second operand has 7 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:34:21,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:34:21,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2022-12-06 16:34:21,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:34:35,722 INFO L130 PetriNetUnfolder]: 19144/45601 cut-off events. [2022-12-06 16:34:35,722 INFO L131 PetriNetUnfolder]: For 311413/344272 co-relation queries the response was YES. [2022-12-06 16:34:35,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197824 conditions, 45601 events. 19144/45601 cut-off events. For 311413/344272 co-relation queries the response was YES. Maximal size of possible extension queue 2435. Compared 544595 event pairs, 580 based on Foata normal form. 3672/48017 useless extension candidates. Maximal degree in co-relation 197692. Up to 13357 conditions per place. [2022-12-06 16:34:35,987 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 621 selfloop transitions, 54 changer transitions 1180/2053 dead transitions. [2022-12-06 16:34:35,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 2053 transitions, 36251 flow [2022-12-06 16:34:35,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:34:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:34:35,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1412 transitions. [2022-12-06 16:34:35,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8689230769230769 [2022-12-06 16:34:35,989 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 117 predicate places. [2022-12-06 16:34:35,989 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 2053 transitions, 36251 flow [2022-12-06 16:34:35,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:34:35,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:34:35,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:34:35,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 16:34:35,990 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:34:35,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:34:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1972672759, now seen corresponding path program 1 times [2022-12-06 16:34:35,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:34:35,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693007278] [2022-12-06 16:34:35,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:34:35,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:34:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:34:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:34:36,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:34:36,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693007278] [2022-12-06 16:34:36,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693007278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:34:36,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:34:36,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:34:36,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319296212] [2022-12-06 16:34:36,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:34:36,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:34:36,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:34:36,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:34:36,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:34:36,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 125 [2022-12-06 16:34:36,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 2053 transitions, 36251 flow. Second operand has 8 states, 8 states have (on average 91.5) internal successors, (732), 8 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:34:36,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:34:36,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 125 [2022-12-06 16:34:36,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:34:42,090 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][1443], [120#L790true, 139#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 110#L817true, 122#L750true, P0Thread1of1ForFork1InUse, 190#(= ~y~0 1), P3Thread1of1ForFork2InUse, 213#true, 345#(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)), 267#true, 311#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 241#true, 39#L765true, 165#true, 380#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 64#L3true, 142#true]) [2022-12-06 16:34:42,091 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 16:34:42,091 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:34:42,091 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:34:42,091 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:34:42,938 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][1443], [120#L790true, 139#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 122#L750true, 190#(= ~y~0 1), P3Thread1of1ForFork2InUse, 213#true, 345#(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)), 267#true, 311#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 125#L3-1true, 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 241#true, 39#L765true, 165#true, 380#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 142#true]) [2022-12-06 16:34:42,938 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-06 16:34:42,938 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:34:42,938 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:34:42,938 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:34:51,234 INFO L130 PetriNetUnfolder]: 37984/88433 cut-off events. [2022-12-06 16:34:51,234 INFO L131 PetriNetUnfolder]: For 706346/800183 co-relation queries the response was YES. [2022-12-06 16:34:51,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403576 conditions, 88433 events. 37984/88433 cut-off events. For 706346/800183 co-relation queries the response was YES. Maximal size of possible extension queue 4889. Compared 1133955 event pairs, 943 based on Foata normal form. 7907/94012 useless extension candidates. Maximal degree in co-relation 403430. Up to 25449 conditions per place. [2022-12-06 16:34:51,697 INFO L137 encePairwiseOnDemand]: 109/125 looper letters, 392 selfloop transitions, 132 changer transitions 3214/3908 dead transitions. [2022-12-06 16:34:51,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 3908 transitions, 78939 flow [2022-12-06 16:34:51,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 16:34:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 16:34:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1763 transitions. [2022-12-06 16:34:51,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7835555555555556 [2022-12-06 16:34:51,725 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 134 predicate places. [2022-12-06 16:34:51,725 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 3908 transitions, 78939 flow [2022-12-06 16:34:51,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.5) internal successors, (732), 8 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:34:51,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:34:51,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:34:51,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 16:34:51,728 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:34:51,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:34:51,728 INFO L85 PathProgramCache]: Analyzing trace with hash 934239841, now seen corresponding path program 2 times [2022-12-06 16:34:51,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:34:51,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540780053] [2022-12-06 16:34:51,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:34:51,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:34:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:34:52,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:34:52,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:34:52,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540780053] [2022-12-06 16:34:52,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540780053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:34:52,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:34:52,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:34:52,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969010487] [2022-12-06 16:34:52,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:34:52,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:34:52,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:34:52,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:34:52,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:34:52,469 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 125 [2022-12-06 16:34:52,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 3908 transitions, 78939 flow. Second operand has 7 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:34:52,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:34:52,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 125 [2022-12-06 16:34:52,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:35:03,004 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][1942], [120#L790true, 139#true, P2Thread1of1ForFork0InUse, 407#(= ~x~0 1), P1Thread1of1ForFork3InUse, 110#L817true, 122#L750true, P0Thread1of1ForFork1InUse, 190#(= ~y~0 1), P3Thread1of1ForFork2InUse, 213#true, 345#(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)), 267#true, 311#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 241#true, 39#L765true, 165#true, 380#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 64#L3true, 142#true]) [2022-12-06 16:35:03,005 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 16:35:03,005 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:35:03,005 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:35:03,005 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:35:03,137 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][1394], [139#true, P2Thread1of1ForFork0InUse, 99#L787true, P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 122#L750true, 405#true, P3Thread1of1ForFork2InUse, 213#true, 312#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 267#true, 341#(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)), 241#true, 39#L765true, 165#true, 64#L3true, 360#(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)), 371#(= ~a~0 1), 142#true, 188#true]) [2022-12-06 16:35:03,137 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-06 16:35:03,137 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:35:03,137 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:35:03,137 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:35:04,486 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][1942], [120#L790true, 139#true, P2Thread1of1ForFork0InUse, 407#(= ~x~0 1), P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 122#L750true, 190#(= ~y~0 1), 213#true, P3Thread1of1ForFork2InUse, 345#(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)), 267#true, 311#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 125#L3-1true, 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 241#true, 39#L765true, 165#true, 380#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 142#true]) [2022-12-06 16:35:04,486 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-06 16:35:04,486 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:35:04,486 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:35:04,486 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:35:04,747 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][1394], [139#true, P2Thread1of1ForFork0InUse, 99#L787true, P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 405#true, 122#L750true, 312#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 213#true, P3Thread1of1ForFork2InUse, 267#true, 341#(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)), 125#L3-1true, 241#true, 39#L765true, 165#true, 360#(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)), 371#(= ~a~0 1), 188#true, 142#true]) [2022-12-06 16:35:04,747 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 16:35:04,747 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:35:04,747 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:35:04,747 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:35:04,748 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][1777], [139#true, P2Thread1of1ForFork0InUse, 99#L787true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 405#true, 122#L750true, P3Thread1of1ForFork2InUse, 312#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 213#true, 345#(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)), 267#true, 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 241#true, 39#L765true, 165#true, 64#L3true, 13#L820true, 371#(= ~a~0 1), 188#true, 142#true]) [2022-12-06 16:35:04,748 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 16:35:04,748 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:35:04,748 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:35:04,748 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:35:06,164 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][1777], [139#true, P2Thread1of1ForFork0InUse, 99#L787true, P1Thread1of1ForFork3InUse, 405#true, P0Thread1of1ForFork1InUse, 122#L750true, 213#true, 312#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork2InUse, 345#(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)), 267#true, 125#L3-1true, 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 241#true, 39#L765true, 165#true, 13#L820true, 371#(= ~a~0 1), 142#true, 188#true]) [2022-12-06 16:35:06,164 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-06 16:35:06,164 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:35:06,164 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:35:06,164 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:35:26,401 INFO L130 PetriNetUnfolder]: 56587/135493 cut-off events. [2022-12-06 16:35:26,402 INFO L131 PetriNetUnfolder]: For 1254998/1457920 co-relation queries the response was YES. [2022-12-06 16:35:26,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653960 conditions, 135493 events. 56587/135493 cut-off events. For 1254998/1457920 co-relation queries the response was YES. Maximal size of possible extension queue 7063. Compared 1869585 event pairs, 1807 based on Foata normal form. 16691/148515 useless extension candidates. Maximal degree in co-relation 653801. Up to 39776 conditions per place. [2022-12-06 16:35:27,118 INFO L137 encePairwiseOnDemand]: 110/125 looper letters, 586 selfloop transitions, 99 changer transitions 5597/6463 dead transitions. [2022-12-06 16:35:27,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 6463 transitions, 143919 flow [2022-12-06 16:35:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:35:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:35:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1316 transitions. [2022-12-06 16:35:27,121 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8098461538461539 [2022-12-06 16:35:27,121 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 146 predicate places. [2022-12-06 16:35:27,121 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 6463 transitions, 143919 flow [2022-12-06 16:35:27,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:27,121 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:27,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:27,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 16:35:27,122 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:35:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2103458543, now seen corresponding path program 1 times [2022-12-06 16:35:27,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:27,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302691114] [2022-12-06 16:35:27,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:35:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:35:27,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:35:27,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302691114] [2022-12-06 16:35:27,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302691114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:35:27,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:35:27,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:35:27,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962897925] [2022-12-06 16:35:27,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:35:27,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:35:27,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:35:27,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:35:27,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:35:27,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2022-12-06 16:35:27,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 6463 transitions, 143919 flow. Second operand has 8 states, 8 states have (on average 102.125) internal successors, (817), 8 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:27,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:35:27,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2022-12-06 16:35:27,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:07,060 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][1484], [139#true, P2Thread1of1ForFork0InUse, 99#L787true, 407#(= ~x~0 1), P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 122#L750true, P3Thread1of1ForFork2InUse, 213#true, 267#true, 341#(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)), 311#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 450#(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)), 241#true, 39#L765true, 165#true, 380#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 64#L3true, 360#(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)), 142#true, 188#true]) [2022-12-06 16:36:07,060 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-06 16:36:07,060 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:36:07,060 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:36:07,060 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:36:09,044 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][1397], [139#true, P2Thread1of1ForFork0InUse, 99#L787true, P1Thread1of1ForFork3InUse, 110#L817true, 405#true, P0Thread1of1ForFork1InUse, 122#L750true, 213#true, 312#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork2InUse, 267#true, 341#(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)), 450#(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)), 241#true, 39#L765true, 165#true, 360#(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)), 64#L3true, 371#(= ~a~0 1), 142#true, 188#true]) [2022-12-06 16:36:09,045 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-06 16:36:09,045 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:36:09,045 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:36:09,045 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:36:15,578 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][1484], [139#true, P2Thread1of1ForFork0InUse, 407#(= ~x~0 1), 99#L787true, P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 122#L750true, 213#true, P3Thread1of1ForFork2InUse, 341#(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)), 267#true, 125#L3-1true, 311#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 450#(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)), 241#true, 39#L765true, 165#true, 380#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 360#(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)), 142#true, 188#true]) [2022-12-06 16:36:15,579 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 16:36:15,579 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:36:15,579 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:36:15,579 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:36:17,803 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][1397], [139#true, P2Thread1of1ForFork0InUse, 99#L787true, P1Thread1of1ForFork3InUse, 110#L817true, 405#true, P0Thread1of1ForFork1InUse, 122#L750true, 213#true, 312#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork2InUse, 267#true, 341#(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)), 125#L3-1true, 450#(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)), 241#true, 39#L765true, 165#true, 360#(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)), 371#(= ~a~0 1), 142#true, 188#true]) [2022-12-06 16:36:17,803 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 16:36:17,803 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:36:17,803 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:36:17,803 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:36:17,804 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][1839], [139#true, P2Thread1of1ForFork0InUse, 99#L787true, 456#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 405#true, 122#L750true, 213#true, 312#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork2InUse, 345#(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)), 267#true, 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 241#true, 39#L765true, 165#true, 64#L3true, 13#L820true, 371#(= ~a~0 1), 142#true, 188#true]) [2022-12-06 16:36:17,804 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 16:36:17,804 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:36:17,804 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:36:17,804 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:36:26,872 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][1839], [139#true, P2Thread1of1ForFork0InUse, 99#L787true, 456#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 405#true, 122#L750true, P3Thread1of1ForFork2InUse, 213#true, 312#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 345#(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)), 267#true, 125#L3-1true, 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 241#true, 39#L765true, 165#true, 13#L820true, 371#(= ~a~0 1), 188#true, 142#true]) [2022-12-06 16:36:26,872 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-06 16:36:26,872 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:36:26,872 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:36:26,872 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:36:42,952 INFO L130 PetriNetUnfolder]: 44932/93642 cut-off events. [2022-12-06 16:36:42,952 INFO L131 PetriNetUnfolder]: For 1133849/1351173 co-relation queries the response was YES. [2022-12-06 16:36:43,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496293 conditions, 93642 events. 44932/93642 cut-off events. For 1133849/1351173 co-relation queries the response was YES. Maximal size of possible extension queue 7101. Compared 1169851 event pairs, 242 based on Foata normal form. 16535/107988 useless extension candidates. Maximal degree in co-relation 496130. Up to 27730 conditions per place. [2022-12-06 16:36:43,413 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 292 selfloop transitions, 88 changer transitions 3526/4099 dead transitions. [2022-12-06 16:36:43,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 4099 transitions, 102872 flow [2022-12-06 16:36:43,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:36:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:36:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1739 transitions. [2022-12-06 16:36:43,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8695 [2022-12-06 16:36:43,415 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 119 predicate places. [2022-12-06 16:36:43,415 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 4099 transitions, 102872 flow [2022-12-06 16:36:43,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.125) internal successors, (817), 8 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:43,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:43,416 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:36:43,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 16:36:43,416 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:36:43,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:43,416 INFO L85 PathProgramCache]: Analyzing trace with hash -546434010, now seen corresponding path program 1 times [2022-12-06 16:36:43,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:43,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797330256] [2022-12-06 16:36:43,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:43,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:43,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:43,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797330256] [2022-12-06 16:36:43,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797330256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:43,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:43,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 16:36:43,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210001173] [2022-12-06 16:36:43,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:43,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 16:36:43,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:43,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 16:36:43,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 16:36:43,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2022-12-06 16:36:43,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 4099 transitions, 102872 flow. Second operand has 9 states, 9 states have (on average 102.11111111111111) internal successors, (919), 9 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:43,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:43,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2022-12-06 16:36:43,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:37:03,688 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][1238], [139#true, 111#L845true, 452#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, 485#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 407#(= ~x~0 1), 99#L787true, P1Thread1of1ForFork3InUse, 110#L817true, 362#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, 122#L750true, 213#true, P3Thread1of1ForFork2InUse, 267#true, 311#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 241#true, 165#true, 380#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 21#L770true, 330#true, 142#true, 188#true]) [2022-12-06 16:37:03,688 INFO L382 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-12-06 16:37:03,688 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-06 16:37:03,688 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-06 16:37:03,688 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-06 16:37:08,975 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][1238], [139#true, 452#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, 485#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 99#L787true, 407#(= ~x~0 1), P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 122#L750true, 362#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, 213#true, 267#true, 311#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 241#true, 165#true, 76#L2true, 21#L770true, 380#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 330#true, 188#true, 142#true]) [2022-12-06 16:37:08,976 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-06 16:37:08,976 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:37:08,976 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:37:08,976 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:37:08,981 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][1704], [120#L790true, 111#L845true, 139#true, P2Thread1of1ForFork0InUse, 407#(= ~x~0 1), P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 122#L750true, P3Thread1of1ForFork2InUse, 213#true, 366#(and (<= |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)), 454#(and (<= ~__unbuffered_cnt~0 2) (<= |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)), 267#true, 311#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 489#(and (<= ~__unbuffered_cnt~0 2) (<= |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)), 241#true, 165#true, 21#L770true, 380#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 330#true, 142#true, 188#true]) [2022-12-06 16:37:08,981 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-06 16:37:08,981 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:37:08,981 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:37:08,981 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:37:10,938 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][1421], [139#true, P2Thread1of1ForFork0InUse, 99#L787true, P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 405#true, 122#L750true, P3Thread1of1ForFork2InUse, 312#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 213#true, 267#true, 341#(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)), 450#(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)), 241#true, 39#L765true, 165#true, 483#(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)), 64#L3true, 360#(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)), 371#(= ~a~0 1), 188#true, 142#true]) [2022-12-06 16:37:10,938 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-06 16:37:10,938 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:37:10,938 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:37:10,938 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 16:37:14,915 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][1713], [139#true, P2Thread1of1ForFork0InUse, 407#(= ~x~0 1), 456#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 99#L787true, P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 122#L750true, 213#true, P3Thread1of1ForFork2InUse, 267#true, 311#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 487#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 241#true, 165#true, 380#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 21#L770true, 64#L3true, 330#true, 188#true, 142#true]) [2022-12-06 16:37:14,916 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 16:37:14,916 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:37:14,916 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:37:14,916 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:37:14,920 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][1704], [120#L790true, 139#true, P2Thread1of1ForFork0InUse, 407#(= ~x~0 1), P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 122#L750true, P3Thread1of1ForFork2InUse, 213#true, 366#(and (<= |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)), 454#(and (<= ~__unbuffered_cnt~0 2) (<= |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)), 267#true, 311#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 489#(and (<= ~__unbuffered_cnt~0 2) (<= |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)), 241#true, 165#true, 380#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 76#L2true, 21#L770true, 330#true, 188#true, 142#true]) [2022-12-06 16:37:14,920 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 16:37:14,920 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:37:14,920 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:37:14,920 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:37:16,297 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][1421], [139#true, P2Thread1of1ForFork0InUse, 99#L787true, P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 122#L750true, 405#true, P3Thread1of1ForFork2InUse, 213#true, 312#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 267#true, 341#(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)), 125#L3-1true, 450#(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)), 241#true, 39#L765true, 165#true, 483#(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)), 360#(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)), 371#(= ~a~0 1), 142#true, 188#true]) [2022-12-06 16:37:16,297 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 16:37:16,297 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:37:16,297 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:37:16,297 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:37:16,297 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][1860], [139#true, P2Thread1of1ForFork0InUse, 99#L787true, 456#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), P1Thread1of1ForFork3InUse, 405#true, P0Thread1of1ForFork1InUse, 122#L750true, 213#true, 312#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork2InUse, 345#(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)), 267#true, 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 487#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 241#true, 39#L765true, 165#true, 13#L820true, 64#L3true, 371#(= ~a~0 1), 188#true, 142#true]) [2022-12-06 16:37:16,298 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 16:37:16,298 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:37:16,298 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:37:16,298 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 16:37:19,879 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][2021], [139#true, P2Thread1of1ForFork0InUse, 99#L787true, 456#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 407#(= ~x~0 1), P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 122#L750true, 213#true, P3Thread1of1ForFork2InUse, 267#true, 125#L3-1true, 311#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 487#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 241#true, 165#true, 21#L770true, 380#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 335#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 188#true, 142#true]) [2022-12-06 16:37:19,879 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-06 16:37:19,879 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:37:19,879 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:37:19,879 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:37:19,882 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][2261], [120#L790true, 139#true, 368#(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)), P2Thread1of1ForFork0InUse, 407#(= ~x~0 1), P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 122#L750true, 213#true, 491#(and (<= ~__unbuffered_cnt~0 2) (<= |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)), P3Thread1of1ForFork2InUse, 267#true, 311#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 458#(and (<= ~__unbuffered_cnt~0 2) (<= |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)), 241#true, 165#true, 380#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 21#L770true, 64#L3true, 330#true, 142#true, 188#true]) [2022-12-06 16:37:19,882 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-06 16:37:19,882 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:37:19,882 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:37:19,882 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:37:21,082 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][1860], [139#true, P2Thread1of1ForFork0InUse, 99#L787true, 456#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 405#true, 122#L750true, P3Thread1of1ForFork2InUse, 213#true, 312#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 345#(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)), 267#true, 125#L3-1true, 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 487#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |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)), 241#true, 39#L765true, 165#true, 13#L820true, 371#(= ~a~0 1), 142#true, 188#true]) [2022-12-06 16:37:21,082 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-06 16:37:21,082 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:37:21,082 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:37:21,082 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:37:23,538 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][2475], [120#L790true, 139#true, 368#(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)), P2Thread1of1ForFork0InUse, 407#(= ~x~0 1), P1Thread1of1ForFork3InUse, 110#L817true, P0Thread1of1ForFork1InUse, 122#L750true, 213#true, 491#(and (<= ~__unbuffered_cnt~0 2) (<= |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)), P3Thread1of1ForFork2InUse, 267#true, 125#L3-1true, 311#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 458#(and (<= ~__unbuffered_cnt~0 2) (<= |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)), 241#true, 165#true, 335#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 380#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 21#L770true, 142#true, 188#true]) [2022-12-06 16:37:23,539 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-06 16:37:23,539 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 16:37:23,539 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 16:37:23,539 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 16:37:27,666 INFO L130 PetriNetUnfolder]: 43896/88643 cut-off events. [2022-12-06 16:37:27,667 INFO L131 PetriNetUnfolder]: For 1128903/1322758 co-relation queries the response was YES. [2022-12-06 16:37:28,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534355 conditions, 88643 events. 43896/88643 cut-off events. For 1128903/1322758 co-relation queries the response was YES. Maximal size of possible extension queue 7101. Compared 1104680 event pairs, 229 based on Foata normal form. 16486/103176 useless extension candidates. Maximal degree in co-relation 534188. Up to 26235 conditions per place. [2022-12-06 16:37:28,089 INFO L137 encePairwiseOnDemand]: 114/125 looper letters, 22 selfloop transitions, 19 changer transitions 3469/3594 dead transitions. [2022-12-06 16:37:28,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 3594 transitions, 98658 flow [2022-12-06 16:37:28,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 16:37:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 16:37:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2030 transitions. [2022-12-06 16:37:28,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8547368421052631 [2022-12-06 16:37:28,091 INFO L294 CegarLoopForPetriNet]: 132 programPoint places, 104 predicate places. [2022-12-06 16:37:28,092 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 3594 transitions, 98658 flow [2022-12-06 16:37:28,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.11111111111111) internal successors, (919), 9 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:28,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:37:28,092 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:37:28,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 16:37:28,092 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 16:37:28,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:37:28,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1150456608, now seen corresponding path program 1 times [2022-12-06 16:37:28,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:37:28,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898226982] [2022-12-06 16:37:28,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:37:28,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:37:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:37:28,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:37:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:37:28,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:37:28,194 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:37:28,195 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 16:37:28,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 16:37:28,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 16:37:28,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 16:37:28,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 16:37:28,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 16:37:28,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 16:37:28,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 16:37:28,200 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:37:28,204 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:37:28,205 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:37:28,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:37:28 BasicIcfg [2022-12-06 16:37:28,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:37:28,305 INFO L158 Benchmark]: Toolchain (without parser) took 267448.45ms. Allocated memory was 197.1MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 155.9MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-06 16:37:28,305 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory was 173.7MB in the beginning and 173.7MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:37:28,305 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.39ms. Allocated memory is still 197.1MB. Free memory was 155.4MB in the beginning and 128.6MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 16:37:28,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.83ms. Allocated memory is still 197.1MB. Free memory was 128.6MB in the beginning and 126.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:37:28,306 INFO L158 Benchmark]: Boogie Preprocessor took 31.02ms. Allocated memory is still 197.1MB. Free memory was 126.0MB in the beginning and 123.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:37:28,306 INFO L158 Benchmark]: RCFGBuilder took 573.56ms. Allocated memory is still 197.1MB. Free memory was 123.9MB in the beginning and 90.9MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-06 16:37:28,306 INFO L158 Benchmark]: TraceAbstraction took 266347.16ms. Allocated memory was 197.1MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 90.4MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-06 16:37:28,307 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.10ms. Allocated memory is still 197.1MB. Free memory was 173.7MB in the beginning and 173.7MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 430.39ms. Allocated memory is still 197.1MB. Free memory was 155.4MB in the beginning and 128.6MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.83ms. Allocated memory is still 197.1MB. Free memory was 128.6MB in the beginning and 126.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.02ms. Allocated memory is still 197.1MB. Free memory was 126.0MB in the beginning and 123.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 573.56ms. Allocated memory is still 197.1MB. Free memory was 123.9MB in the beginning and 90.9MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 266347.16ms. Allocated memory was 197.1MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 90.4MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 3.4GB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L723] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L724] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L725] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L726] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L727] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L728] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L729] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0] [L730] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0] [L731] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L732] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=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_p3_EAX=0, a=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_buff0_thd4=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$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L735] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L736] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L737] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L738] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L739] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L740] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L834] 0 pthread_t t1517; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1517={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1517, ((void *)0), P0, ((void *)0))=-3, t1517={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L836] 0 pthread_t t1518; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, t1518={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1518, ((void *)0), P1, ((void *)0))=-2, t1517={5:0}, t1518={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 t1519; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1519, ((void *)0), P2, ((void *)0))=-1, t1517={5:0}, t1518={6:0}, t1519={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 t1520; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1520, ((void *)0), P3, ((void *)0))=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L800] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L800] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 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) [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 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 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 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) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 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=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, 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=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, 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: 837]: 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: 835]: 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 9 procedures, 159 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 266.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 259.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1450 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1450 mSDsluCounter, 1626 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1242 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2281 IncrementalHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 384 mSDtfsCounter, 2281 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143919occurred in iteration=12, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1264 NumberOfCodeBlocks, 1264 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1154 ConstructedInterpolants, 0 QuantifiedInterpolants, 5136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 16:37:28,323 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...