/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/mix002.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 20:50:57,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 20:50:57,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 20:50:57,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 20:50:57,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 20:50:57,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 20:50:57,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 20:50:57,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 20:50:57,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 20:50:57,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 20:50:57,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 20:50:57,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 20:50:57,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 20:50:57,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 20:50:57,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 20:50:57,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 20:50:57,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 20:50:57,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 20:50:57,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 20:50:57,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 20:50:57,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 20:50:57,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 20:50:57,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 20:50:57,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 20:50:57,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 20:50:57,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 20:50:57,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 20:50:57,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 20:50:57,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 20:50:57,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 20:50:57,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 20:50:57,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 20:50:57,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 20:50:57,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 20:50:57,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 20:50:57,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 20:50:57,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 20:50:57,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 20:50:57,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 20:50:57,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 20:50:57,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 20:50:57,478 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 20:50:57,506 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 20:50:57,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 20:50:57,508 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 20:50:57,508 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 20:50:57,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 20:50:57,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 20:50:57,509 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 20:50:57,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 20:50:57,510 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 20:50:57,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 20:50:57,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 20:50:57,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 20:50:57,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 20:50:57,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 20:50:57,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 20:50:57,511 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 20:50:57,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 20:50:57,511 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 20:50:57,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 20:50:57,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 20:50:57,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 20:50:57,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 20:50:57,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 20:50:57,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:50:57,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 20:50:57,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 20:50:57,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 20:50:57,513 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 20:50:57,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 20:50:57,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 20:50:57,513 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 20:50:57,513 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-11 20:50:57,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 20:50:57,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 20:50:57,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 20:50:57,788 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 20:50:57,788 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 20:50:57,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2022-12-11 20:50:58,722 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 20:50:58,927 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 20:50:58,927 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2022-12-11 20:50:58,945 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4af3d7a1/77c3f45892c4400f9e4cbda78f2a7dea/FLAG2c7924370 [2022-12-11 20:50:58,957 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4af3d7a1/77c3f45892c4400f9e4cbda78f2a7dea [2022-12-11 20:50:58,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 20:50:58,961 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 20:50:58,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 20:50:58,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 20:50:58,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 20:50:58,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:50:58" (1/1) ... [2022-12-11 20:50:58,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5807169f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:58, skipping insertion in model container [2022-12-11 20:50:58,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:50:58" (1/1) ... [2022-12-11 20:50:58,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 20:50:59,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 20:50:59,161 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/mix002.oepc.i[945,958] [2022-12-11 20:50:59,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:50:59,375 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 20:50:59,383 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/mix002.oepc.i[945,958] [2022-12-11 20:50:59,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:59,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:59,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:50:59,457 INFO L208 MainTranslator]: Completed translation [2022-12-11 20:50:59,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:59 WrapperNode [2022-12-11 20:50:59,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 20:50:59,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 20:50:59,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 20:50:59,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 20:50:59,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:59" (1/1) ... [2022-12-11 20:50:59,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:59" (1/1) ... [2022-12-11 20:50:59,520 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2022-12-11 20:50:59,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 20:50:59,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 20:50:59,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 20:50:59,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 20:50:59,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:59" (1/1) ... [2022-12-11 20:50:59,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:59" (1/1) ... [2022-12-11 20:50:59,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:59" (1/1) ... [2022-12-11 20:50:59,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:59" (1/1) ... [2022-12-11 20:50:59,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:59" (1/1) ... [2022-12-11 20:50:59,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:59" (1/1) ... [2022-12-11 20:50:59,563 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:59" (1/1) ... [2022-12-11 20:50:59,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:59" (1/1) ... [2022-12-11 20:50:59,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 20:50:59,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 20:50:59,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 20:50:59,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 20:50:59,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:59" (1/1) ... [2022-12-11 20:50:59,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:50:59,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:50:59,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 20:50:59,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 20:50:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 20:50:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 20:50:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 20:50:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 20:50:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 20:50:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 20:50:59,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 20:50:59,636 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 20:50:59,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 20:50:59,636 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 20:50:59,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 20:50:59,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 20:50:59,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 20:50:59,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 20:50:59,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 20:50:59,638 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 20:50:59,738 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 20:50:59,739 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 20:50:59,986 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 20:51:00,060 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 20:51:00,060 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 20:51:00,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:51:00 BoogieIcfgContainer [2022-12-11 20:51:00,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 20:51:00,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 20:51:00,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 20:51:00,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 20:51:00,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 08:50:58" (1/3) ... [2022-12-11 20:51:00,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df291b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:51:00, skipping insertion in model container [2022-12-11 20:51:00,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:59" (2/3) ... [2022-12-11 20:51:00,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df291b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:51:00, skipping insertion in model container [2022-12-11 20:51:00,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:51:00" (3/3) ... [2022-12-11 20:51:00,074 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-12-11 20:51:00,086 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 20:51:00,086 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 20:51:00,086 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 20:51:00,166 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 20:51:00,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-12-11 20:51:00,251 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-12-11 20:51:00,252 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 20:51:00,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-11 20:51:00,256 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-12-11 20:51:00,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-12-11 20:51:00,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 20:51:00,278 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;@4f3e0e97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 20:51:00,279 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 20:51:00,301 INFO L130 PetriNetUnfolder]: 0/47 cut-off events. [2022-12-11 20:51:00,301 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 20:51:00,301 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:51:00,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:51:00,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:51:00,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:51:00,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1087283299, now seen corresponding path program 1 times [2022-12-11 20:51:00,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:51:00,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090734984] [2022-12-11 20:51:00,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:51:00,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:51:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:51:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:51:00,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:51:00,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090734984] [2022-12-11 20:51:00,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090734984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:51:00,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:51:00,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 20:51:00,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695680627] [2022-12-11 20:51:00,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:51:00,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 20:51:00,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:51:00,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 20:51:00,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 20:51:00,719 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 117 [2022-12-11 20:51:00,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:00,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:51:00,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 117 [2022-12-11 20:51:00,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:51:00,814 INFO L130 PetriNetUnfolder]: 58/306 cut-off events. [2022-12-11 20:51:00,814 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-11 20:51:00,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 306 events. 58/306 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1342 event pairs, 10 based on Foata normal form. 26/321 useless extension candidates. Maximal degree in co-relation 381. Up to 79 conditions per place. [2022-12-11 20:51:00,820 INFO L137 encePairwiseOnDemand]: 112/117 looper letters, 14 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2022-12-11 20:51:00,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 116 transitions, 279 flow [2022-12-11 20:51:00,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 20:51:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 20:51:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-12-11 20:51:00,834 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9401709401709402 [2022-12-11 20:51:00,838 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 0 predicate places. [2022-12-11 20:51:00,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 116 transitions, 279 flow [2022-12-11 20:51:00,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 116 transitions, 279 flow [2022-12-11 20:51:00,843 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 116 transitions, 279 flow [2022-12-11 20:51:00,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:00,844 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:51:00,844 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:51:00,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 20:51:00,844 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:51:00,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:51:00,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1965674337, now seen corresponding path program 1 times [2022-12-11 20:51:00,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:51:00,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516060058] [2022-12-11 20:51:00,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:51:00,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:51:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:51:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:51:01,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:51:01,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516060058] [2022-12-11 20:51:01,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516060058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:51:01,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:51:01,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:51:01,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163235732] [2022-12-11 20:51:01,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:51:01,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:51:01,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:51:01,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:51:01,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:51:01,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 117 [2022-12-11 20:51:01,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 116 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:01,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:51:01,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 117 [2022-12-11 20:51:01,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:51:02,038 INFO L130 PetriNetUnfolder]: 1982/4653 cut-off events. [2022-12-11 20:51:02,038 INFO L131 PetriNetUnfolder]: For 1047/1632 co-relation queries the response was YES. [2022-12-11 20:51:02,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8855 conditions, 4653 events. 1982/4653 cut-off events. For 1047/1632 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 37911 event pairs, 674 based on Foata normal form. 0/4496 useless extension candidates. Maximal degree in co-relation 8792. Up to 1568 conditions per place. [2022-12-11 20:51:02,061 INFO L137 encePairwiseOnDemand]: 109/117 looper letters, 41 selfloop transitions, 4 changer transitions 85/204 dead transitions. [2022-12-11 20:51:02,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 204 transitions, 807 flow [2022-12-11 20:51:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 20:51:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 20:51:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 958 transitions. [2022-12-11 20:51:02,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8188034188034188 [2022-12-11 20:51:02,065 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2022-12-11 20:51:02,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 204 transitions, 807 flow [2022-12-11 20:51:02,076 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 119 transitions, 401 flow [2022-12-11 20:51:02,076 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 119 transitions, 401 flow [2022-12-11 20:51:02,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:02,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:51:02,077 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:51:02,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 20:51:02,077 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:51:02,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:51:02,077 INFO L85 PathProgramCache]: Analyzing trace with hash -933499719, now seen corresponding path program 1 times [2022-12-11 20:51:02,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:51:02,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250342150] [2022-12-11 20:51:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:51:02,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:51:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:51:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:51:02,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:51:02,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250342150] [2022-12-11 20:51:02,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250342150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:51:02,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:51:02,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:51:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043971060] [2022-12-11 20:51:02,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:51:02,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:51:02,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:51:02,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:51:02,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:51:02,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 117 [2022-12-11 20:51:02,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 119 transitions, 401 flow. Second operand has 7 states, 7 states have (on average 88.42857142857143) internal successors, (619), 7 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:02,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:51:02,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 117 [2022-12-11 20:51:02,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:51:02,756 INFO L130 PetriNetUnfolder]: 1195/2339 cut-off events. [2022-12-11 20:51:02,756 INFO L131 PetriNetUnfolder]: For 871/2524 co-relation queries the response was YES. [2022-12-11 20:51:02,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6824 conditions, 2339 events. 1195/2339 cut-off events. For 871/2524 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13822 event pairs, 413 based on Foata normal form. 61/2292 useless extension candidates. Maximal degree in co-relation 6752. Up to 1701 conditions per place. [2022-12-11 20:51:02,789 INFO L137 encePairwiseOnDemand]: 111/117 looper letters, 56 selfloop transitions, 3 changer transitions 58/191 dead transitions. [2022-12-11 20:51:02,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 191 transitions, 1018 flow [2022-12-11 20:51:02,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 20:51:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 20:51:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 860 transitions. [2022-12-11 20:51:02,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8167141500474834 [2022-12-11 20:51:02,792 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 1 predicate places. [2022-12-11 20:51:02,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 191 transitions, 1018 flow [2022-12-11 20:51:02,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 133 transitions, 604 flow [2022-12-11 20:51:02,799 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 133 transitions, 604 flow [2022-12-11 20:51:02,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.42857142857143) internal successors, (619), 7 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:02,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:51:02,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:51:02,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 20:51:02,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:51:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:51:02,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1433710696, now seen corresponding path program 1 times [2022-12-11 20:51:02,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:51:02,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543585877] [2022-12-11 20:51:02,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:51:02,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:51:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:51:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:51:03,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:51:03,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543585877] [2022-12-11 20:51:03,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543585877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:51:03,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:51:03,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 20:51:03,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926611848] [2022-12-11 20:51:03,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:51:03,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 20:51:03,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:51:03,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 20:51:03,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-11 20:51:03,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 117 [2022-12-11 20:51:03,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 133 transitions, 604 flow. Second operand has 10 states, 10 states have (on average 86.1) internal successors, (861), 10 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:03,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:51:03,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 117 [2022-12-11 20:51:03,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:51:03,514 INFO L130 PetriNetUnfolder]: 895/1743 cut-off events. [2022-12-11 20:51:03,514 INFO L131 PetriNetUnfolder]: For 1168/4702 co-relation queries the response was YES. [2022-12-11 20:51:03,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6627 conditions, 1743 events. 895/1743 cut-off events. For 1168/4702 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 9441 event pairs, 116 based on Foata normal form. 51/1728 useless extension candidates. Maximal degree in co-relation 6544. Up to 1277 conditions per place. [2022-12-11 20:51:03,523 INFO L137 encePairwiseOnDemand]: 103/117 looper letters, 81 selfloop transitions, 20 changer transitions 59/232 dead transitions. [2022-12-11 20:51:03,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 232 transitions, 1622 flow [2022-12-11 20:51:03,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 20:51:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 20:51:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1368 transitions. [2022-12-11 20:51:03,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7794871794871795 [2022-12-11 20:51:03,527 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2022-12-11 20:51:03,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 232 transitions, 1622 flow [2022-12-11 20:51:03,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 173 transitions, 1102 flow [2022-12-11 20:51:03,539 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 173 transitions, 1102 flow [2022-12-11 20:51:03,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 86.1) internal successors, (861), 10 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:03,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:51:03,540 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:51:03,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 20:51:03,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:51:03,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:51:03,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1528950948, now seen corresponding path program 1 times [2022-12-11 20:51:03,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:51:03,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207636159] [2022-12-11 20:51:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:51:03,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:51:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:51:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:51:03,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:51:03,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207636159] [2022-12-11 20:51:03,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207636159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:51:03,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:51:03,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:51:03,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502306934] [2022-12-11 20:51:03,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:51:03,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:51:03,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:51:03,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:51:03,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:51:03,696 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-12-11 20:51:03,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 173 transitions, 1102 flow. Second operand has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:03,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:51:03,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-12-11 20:51:03,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:51:04,314 INFO L130 PetriNetUnfolder]: 2464/4697 cut-off events. [2022-12-11 20:51:04,314 INFO L131 PetriNetUnfolder]: For 12436/14695 co-relation queries the response was YES. [2022-12-11 20:51:04,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17036 conditions, 4697 events. 2464/4697 cut-off events. For 12436/14695 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 34318 event pairs, 88 based on Foata normal form. 39/4538 useless extension candidates. Maximal degree in co-relation 16949. Up to 2098 conditions per place. [2022-12-11 20:51:04,341 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 203 selfloop transitions, 17 changer transitions 33/358 dead transitions. [2022-12-11 20:51:04,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 358 transitions, 3239 flow [2022-12-11 20:51:04,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 20:51:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 20:51:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1019 transitions. [2022-12-11 20:51:04,344 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.870940170940171 [2022-12-11 20:51:04,344 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2022-12-11 20:51:04,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 358 transitions, 3239 flow [2022-12-11 20:51:04,363 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 325 transitions, 2843 flow [2022-12-11 20:51:04,363 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 325 transitions, 2843 flow [2022-12-11 20:51:04,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:04,364 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:51:04,364 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:51:04,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 20:51:04,364 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:51:04,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:51:04,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1829744139, now seen corresponding path program 1 times [2022-12-11 20:51:04,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:51:04,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350016656] [2022-12-11 20:51:04,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:51:04,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:51:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:51:04,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:51:04,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:51:04,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350016656] [2022-12-11 20:51:04,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350016656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:51:04,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:51:04,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:51:04,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136800476] [2022-12-11 20:51:04,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:51:04,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:51:04,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:51:04,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:51:04,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:51:04,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-12-11 20:51:04,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 325 transitions, 2843 flow. Second operand has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:04,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:51:04,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-12-11 20:51:04,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:51:05,150 INFO L130 PetriNetUnfolder]: 1652/3753 cut-off events. [2022-12-11 20:51:05,150 INFO L131 PetriNetUnfolder]: For 9692/12363 co-relation queries the response was YES. [2022-12-11 20:51:05,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14508 conditions, 3753 events. 1652/3753 cut-off events. For 9692/12363 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 30184 event pairs, 61 based on Foata normal form. 218/3874 useless extension candidates. Maximal degree in co-relation 14417. Up to 1162 conditions per place. [2022-12-11 20:51:05,170 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 241 selfloop transitions, 44 changer transitions 50/440 dead transitions. [2022-12-11 20:51:05,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 440 transitions, 4528 flow [2022-12-11 20:51:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:51:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:51:05,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1328 transitions. [2022-12-11 20:51:05,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8731097961867192 [2022-12-11 20:51:05,175 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 21 predicate places. [2022-12-11 20:51:05,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 440 transitions, 4528 flow [2022-12-11 20:51:05,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 390 transitions, 3996 flow [2022-12-11 20:51:05,190 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 390 transitions, 3996 flow [2022-12-11 20:51:05,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:05,191 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:51:05,191 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:51:05,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 20:51:05,191 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:51:05,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:51:05,192 INFO L85 PathProgramCache]: Analyzing trace with hash 629105074, now seen corresponding path program 1 times [2022-12-11 20:51:05,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:51:05,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914919741] [2022-12-11 20:51:05,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:51:05,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:51:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:51:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:51:05,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:51:05,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914919741] [2022-12-11 20:51:05,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914919741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:51:05,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:51:05,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 20:51:05,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709045363] [2022-12-11 20:51:05,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:51:05,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 20:51:05,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:51:05,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 20:51:05,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 20:51:05,397 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-12-11 20:51:05,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 390 transitions, 3996 flow. Second operand has 8 states, 8 states have (on average 95.0) internal successors, (760), 8 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:05,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:51:05,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-12-11 20:51:05,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:51:05,999 INFO L130 PetriNetUnfolder]: 1522/3540 cut-off events. [2022-12-11 20:51:06,000 INFO L131 PetriNetUnfolder]: For 10138/12929 co-relation queries the response was YES. [2022-12-11 20:51:06,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16059 conditions, 3540 events. 1522/3540 cut-off events. For 10138/12929 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 29190 event pairs, 55 based on Foata normal form. 226/3681 useless extension candidates. Maximal degree in co-relation 15964. Up to 1008 conditions per place. [2022-12-11 20:51:06,022 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 232 selfloop transitions, 48 changer transitions 30/415 dead transitions. [2022-12-11 20:51:06,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 415 transitions, 4814 flow [2022-12-11 20:51:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 20:51:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 20:51:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1596 transitions. [2022-12-11 20:51:06,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8525641025641025 [2022-12-11 20:51:06,027 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 36 predicate places. [2022-12-11 20:51:06,027 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 415 transitions, 4814 flow [2022-12-11 20:51:06,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 385 transitions, 4478 flow [2022-12-11 20:51:06,043 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 385 transitions, 4478 flow [2022-12-11 20:51:06,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.0) internal successors, (760), 8 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:06,044 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:51:06,044 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:51:06,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 20:51:06,044 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:51:06,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:51:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1766352411, now seen corresponding path program 1 times [2022-12-11 20:51:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:51:06,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887290101] [2022-12-11 20:51:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:51:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:51:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:51:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:51:06,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:51:06,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887290101] [2022-12-11 20:51:06,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887290101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:51:06,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:51:06,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 20:51:06,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208989673] [2022-12-11 20:51:06,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:51:06,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 20:51:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:51:06,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 20:51:06,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-11 20:51:06,646 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 117 [2022-12-11 20:51:06,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 385 transitions, 4478 flow. Second operand has 10 states, 10 states have (on average 83.2) internal successors, (832), 10 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:06,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:51:06,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 117 [2022-12-11 20:51:06,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:51:07,446 INFO L130 PetriNetUnfolder]: 2324/5709 cut-off events. [2022-12-11 20:51:07,446 INFO L131 PetriNetUnfolder]: For 18850/24947 co-relation queries the response was YES. [2022-12-11 20:51:07,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26302 conditions, 5709 events. 2324/5709 cut-off events. For 18850/24947 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 54058 event pairs, 84 based on Foata normal form. 81/5686 useless extension candidates. Maximal degree in co-relation 26192. Up to 1457 conditions per place. [2022-12-11 20:51:07,477 INFO L137 encePairwiseOnDemand]: 99/117 looper letters, 183 selfloop transitions, 160 changer transitions 60/527 dead transitions. [2022-12-11 20:51:07,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 527 transitions, 7402 flow [2022-12-11 20:51:07,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 20:51:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 20:51:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 945 transitions. [2022-12-11 20:51:07,480 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7342657342657343 [2022-12-11 20:51:07,481 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 43 predicate places. [2022-12-11 20:51:07,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 527 transitions, 7402 flow [2022-12-11 20:51:07,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 467 transitions, 6351 flow [2022-12-11 20:51:07,503 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 467 transitions, 6351 flow [2022-12-11 20:51:07,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.2) internal successors, (832), 10 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:07,504 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:51:07,504 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:51:07,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 20:51:07,505 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:51:07,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:51:07,505 INFO L85 PathProgramCache]: Analyzing trace with hash -204037023, now seen corresponding path program 2 times [2022-12-11 20:51:07,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:51:07,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932855167] [2022-12-11 20:51:07,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:51:07,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:51:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:51:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:51:07,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:51:07,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932855167] [2022-12-11 20:51:07,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932855167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:51:07,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:51:07,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 20:51:07,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869942857] [2022-12-11 20:51:07,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:51:07,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 20:51:07,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:51:07,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 20:51:07,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-11 20:51:07,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 117 [2022-12-11 20:51:07,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 467 transitions, 6351 flow. Second operand has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:07,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:51:07,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 117 [2022-12-11 20:51:07,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:51:08,425 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L795-->L802: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_95 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse4 (and .cse5 .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd2~0_23 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_84 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_20) v_~a$r_buff1_thd2~0_19) (= v_~a~0_36 (ite .cse2 v_~a$w_buff0~0_41 (ite .cse3 v_~a$w_buff1~0_34 v_~a~0_37))) (= (ite .cse2 0 v_~a$w_buff0_used~0_96) v_~a$w_buff0_used~0_95) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_85) v_~a$w_buff1_used~0_84) (= (ite .cse4 0 v_~a$r_buff0_thd2~0_24) v_~a$r_buff0_thd2~0_23)))) InVars {~a~0=v_~a~0_37, ~a$w_buff1~0=v_~a$w_buff1~0_34, ~a$w_buff0~0=v_~a$w_buff0~0_41, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_20, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_36, ~a$w_buff1~0=v_~a$w_buff1~0_34, ~a$w_buff0~0=v_~a$w_buff0~0_41, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_19, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_23, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][336], [289#(not (= ~z~0 0)), 247#(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)), 131#true, 47#L3true, 150#(= ~__unbuffered_p0_EAX~0 0), 271#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), 78#L802true, 165#true, 221#(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)), 128#true, P2Thread1of1ForFork0InUse, 103#L763true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 202#(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)), 55#L815true]) [2022-12-11 20:51:08,425 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-11 20:51:08,425 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 20:51:08,425 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 20:51:08,425 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 20:51:08,425 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([362] L815-->L831: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd3~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd3~0_60 256) 0))) (let ((.cse7 (not .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse4)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_117 256) 0) .cse4))) (let ((.cse1 (or .cse11 .cse6 .cse8)) (.cse2 (and (not .cse11) .cse7)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_127 256) 0)) (.cse5 (= (mod v_~a$w_buff1_used~0_116 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_128 (ite .cse1 v_~a$w_buff0_used~0_128 (ite .cse2 0 v_~a$w_buff0_used~0_128))) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_59 (ite .cse0 v_~a$r_buff0_thd3~0_60 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~a$r_buff0_thd3~0_60 (ite (and .cse7 (not .cse3)) 0 v_~a$r_buff0_thd3~0_60)))) (= v_~a$flush_delayed~0_21 0) (= v_~a$w_buff1_used~0_116 (ite .cse0 v_~a$w_buff1_used~0_117 (ite (or .cse3 .cse6 .cse8) v_~a$w_buff1_used~0_117 0))) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_60) (= v_~__unbuffered_p2_EBX~0_12 (ite .cse1 v_~a~0_70 (ite .cse2 v_~a$w_buff0~0_60 v_~a$w_buff1~0_53))) (= v_~a~0_68 (ite .cse0 v_~a$mem_tmp~0_16 v_~__unbuffered_p2_EBX~0_12)) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~a$w_buff1~0_53 v_~a$w_buff1~0_52) (= (ite .cse0 v_~a$r_buff1_thd3~0_56 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd3~0_59 256) 0))) (or .cse3 (and .cse5 .cse9) (and .cse10 .cse9))) v_~a$r_buff1_thd3~0_56 0)) v_~a$r_buff1_thd3~0_55) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30) (= v_~a~0_70 v_~a$mem_tmp~0_16))))) InVars {~a~0=v_~a~0_70, ~a$w_buff1~0=v_~a$w_buff1~0_53, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_56, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_117} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet4, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][341], [8#L831true, 289#(not (= ~z~0 0)), 247#(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)), 262#(= ~a$r_buff0_thd2~0 0), 131#true, 47#L3true, 119#L795true, 150#(= ~__unbuffered_p0_EAX~0 0), 165#true, 221#(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)), 128#true, P2Thread1of1ForFork0InUse, 103#L763true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 202#(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))]) [2022-12-11 20:51:08,426 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-11 20:51:08,426 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 20:51:08,426 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 20:51:08,426 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 20:51:08,502 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L795-->L802: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_95 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse4 (and .cse5 .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd2~0_23 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_84 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_20) v_~a$r_buff1_thd2~0_19) (= v_~a~0_36 (ite .cse2 v_~a$w_buff0~0_41 (ite .cse3 v_~a$w_buff1~0_34 v_~a~0_37))) (= (ite .cse2 0 v_~a$w_buff0_used~0_96) v_~a$w_buff0_used~0_95) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_85) v_~a$w_buff1_used~0_84) (= (ite .cse4 0 v_~a$r_buff0_thd2~0_24) v_~a$r_buff0_thd2~0_23)))) InVars {~a~0=v_~a~0_37, ~a$w_buff1~0=v_~a$w_buff1~0_34, ~a$w_buff0~0=v_~a$w_buff0~0_41, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_20, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_36, ~a$w_buff1~0=v_~a$w_buff1~0_34, ~a$w_buff0~0=v_~a$w_buff0~0_41, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_19, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_23, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][336], [113#L3-1true, 289#(not (= ~z~0 0)), 247#(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)), 131#true, 150#(= ~__unbuffered_p0_EAX~0 0), 271#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), 78#L802true, 165#true, 221#(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)), 128#true, P2Thread1of1ForFork0InUse, 103#L763true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 202#(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)), 55#L815true]) [2022-12-11 20:51:08,503 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-11 20:51:08,503 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 20:51:08,503 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 20:51:08,503 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 20:51:08,503 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([362] L815-->L831: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd3~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd3~0_60 256) 0))) (let ((.cse7 (not .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse4)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_117 256) 0) .cse4))) (let ((.cse1 (or .cse11 .cse6 .cse8)) (.cse2 (and (not .cse11) .cse7)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_127 256) 0)) (.cse5 (= (mod v_~a$w_buff1_used~0_116 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_128 (ite .cse1 v_~a$w_buff0_used~0_128 (ite .cse2 0 v_~a$w_buff0_used~0_128))) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_59 (ite .cse0 v_~a$r_buff0_thd3~0_60 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~a$r_buff0_thd3~0_60 (ite (and .cse7 (not .cse3)) 0 v_~a$r_buff0_thd3~0_60)))) (= v_~a$flush_delayed~0_21 0) (= v_~a$w_buff1_used~0_116 (ite .cse0 v_~a$w_buff1_used~0_117 (ite (or .cse3 .cse6 .cse8) v_~a$w_buff1_used~0_117 0))) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_60) (= v_~__unbuffered_p2_EBX~0_12 (ite .cse1 v_~a~0_70 (ite .cse2 v_~a$w_buff0~0_60 v_~a$w_buff1~0_53))) (= v_~a~0_68 (ite .cse0 v_~a$mem_tmp~0_16 v_~__unbuffered_p2_EBX~0_12)) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~a$w_buff1~0_53 v_~a$w_buff1~0_52) (= (ite .cse0 v_~a$r_buff1_thd3~0_56 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd3~0_59 256) 0))) (or .cse3 (and .cse5 .cse9) (and .cse10 .cse9))) v_~a$r_buff1_thd3~0_56 0)) v_~a$r_buff1_thd3~0_55) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30) (= v_~a~0_70 v_~a$mem_tmp~0_16))))) InVars {~a~0=v_~a~0_70, ~a$w_buff1~0=v_~a$w_buff1~0_53, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_56, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_117} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet4, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][341], [113#L3-1true, 289#(not (= ~z~0 0)), 8#L831true, 247#(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)), 262#(= ~a$r_buff0_thd2~0 0), 131#true, 150#(= ~__unbuffered_p0_EAX~0 0), 119#L795true, 165#true, 221#(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)), 128#true, P2Thread1of1ForFork0InUse, 103#L763true, P0Thread1of1ForFork1InUse, 202#(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)), P1Thread1of1ForFork2InUse]) [2022-12-11 20:51:08,503 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-11 20:51:08,503 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 20:51:08,503 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 20:51:08,503 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 20:51:09,332 INFO L130 PetriNetUnfolder]: 4587/11805 cut-off events. [2022-12-11 20:51:09,332 INFO L131 PetriNetUnfolder]: For 44450/62815 co-relation queries the response was YES. [2022-12-11 20:51:09,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53895 conditions, 11805 events. 4587/11805 cut-off events. For 44450/62815 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 130881 event pairs, 172 based on Foata normal form. 340/11993 useless extension candidates. Maximal degree in co-relation 53773. Up to 2491 conditions per place. [2022-12-11 20:51:09,396 INFO L137 encePairwiseOnDemand]: 96/117 looper letters, 253 selfloop transitions, 228 changer transitions 213/812 dead transitions. [2022-12-11 20:51:09,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 812 transitions, 13509 flow [2022-12-11 20:51:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 20:51:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 20:51:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1493 transitions. [2022-12-11 20:51:09,400 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7506284565108094 [2022-12-11 20:51:09,401 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 56 predicate places. [2022-12-11 20:51:09,401 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 812 transitions, 13509 flow [2022-12-11 20:51:09,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 599 transitions, 9511 flow [2022-12-11 20:51:09,530 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 599 transitions, 9511 flow [2022-12-11 20:51:09,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:51:09,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:51:09,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:51:09,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 20:51:09,531 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:51:09,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:51:09,532 INFO L85 PathProgramCache]: Analyzing trace with hash -854277137, now seen corresponding path program 3 times [2022-12-11 20:51:09,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:51:09,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077107620] [2022-12-11 20:51:09,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:51:09,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:51:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 20:51:09,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 20:51:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 20:51:09,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 20:51:09,649 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 20:51:09,650 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 20:51:09,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 20:51:09,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 20:51:09,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 20:51:09,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 20:51:09,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 20:51:09,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 20:51:09,653 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:51:09,658 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 20:51:09,658 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 20:51:09,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 08:51:09 BasicIcfg [2022-12-11 20:51:09,753 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 20:51:09,754 INFO L158 Benchmark]: Toolchain (without parser) took 10792.86ms. Allocated memory was 189.8MB in the beginning and 612.4MB in the end (delta: 422.6MB). Free memory was 164.7MB in the beginning and 415.2MB in the end (delta: -250.4MB). Peak memory consumption was 172.9MB. Max. memory is 8.0GB. [2022-12-11 20:51:09,754 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 189.8MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 20:51:09,754 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.09ms. Allocated memory is still 189.8MB. Free memory was 164.4MB in the beginning and 137.2MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-11 20:51:09,754 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.39ms. Allocated memory is still 189.8MB. Free memory was 137.2MB in the beginning and 134.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 20:51:09,754 INFO L158 Benchmark]: Boogie Preprocessor took 44.37ms. Allocated memory is still 189.8MB. Free memory was 134.6MB in the beginning and 132.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 20:51:09,754 INFO L158 Benchmark]: RCFGBuilder took 502.15ms. Allocated memory is still 189.8MB. Free memory was 132.5MB in the beginning and 98.4MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-11 20:51:09,755 INFO L158 Benchmark]: TraceAbstraction took 9683.35ms. Allocated memory was 189.8MB in the beginning and 612.4MB in the end (delta: 422.6MB). Free memory was 97.4MB in the beginning and 415.2MB in the end (delta: -317.8MB). Peak memory consumption was 105.8MB. Max. memory is 8.0GB. [2022-12-11 20:51:09,757 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.15ms. Allocated memory is still 189.8MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 494.09ms. Allocated memory is still 189.8MB. Free memory was 164.4MB in the beginning and 137.2MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.39ms. Allocated memory is still 189.8MB. Free memory was 137.2MB in the beginning and 134.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.37ms. Allocated memory is still 189.8MB. Free memory was 134.6MB in the beginning and 132.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 502.15ms. Allocated memory is still 189.8MB. Free memory was 132.5MB in the beginning and 98.4MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 9683.35ms. Allocated memory was 189.8MB in the beginning and 612.4MB in the end (delta: 422.6MB). Free memory was 97.4MB in the beginning and 415.2MB in the end (delta: -317.8MB). Peak memory consumption was 105.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L719] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L721] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L723] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L724] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0] [L725] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L726] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L727] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L728] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L729] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L730] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0] [L731] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L732] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L733] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L734] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0] [L735] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L736] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L737] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L738] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L739] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L740] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L741] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L743] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L745] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L747] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L748] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L749] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t38; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t38, ((void *)0), P0, ((void *)0))=-2, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L857] 0 pthread_t t39; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=-1, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L859] 0 pthread_t t40; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=255, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=255, x=1, y=1, z=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=255, x=1, y=1, z=1] [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=255, x=1, y=1, z=1] - 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: 860]: 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: 856]: 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: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 815 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 815 mSDsluCounter, 750 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 599 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1313 IncrementalHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 151 mSDtfsCounter, 1313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9511occurred in iteration=9, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 7653 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 819 NumberOfCodeBlocks, 819 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 717 ConstructedInterpolants, 0 QuantifiedInterpolants, 5026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-11 20:51:09,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...