/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix050.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:55:26,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:55:26,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:55:26,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:55:26,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:55:26,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:55:26,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:55:26,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:55:26,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:55:26,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:55:26,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:55:26,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:55:26,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:55:26,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:55:26,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:55:26,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:55:26,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:55:26,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:55:26,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:55:26,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:55:26,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:55:26,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:55:26,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:55:26,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:55:26,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:55:26,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:55:26,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:55:26,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:55:26,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:55:26,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:55:26,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:55:26,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:55:26,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:55:26,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:55:26,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:55:26,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:55:26,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:55:26,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:55:26,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:55:26,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:55:26,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:55:26,579 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:55:26,603 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:55:26,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:55:26,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:55:26,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:55:26,604 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:55:26,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:55:26,605 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:55:26,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:55:26,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:55:26,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:55:26,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:55:26,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:55:26,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:55:26,606 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:55:26,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:55:26,606 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:55:26,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:55:26,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:55:26,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:55:26,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:55:26,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:55:26,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:55:26,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:55:26,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:55:26,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:55:26,607 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:55:26,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:55:26,608 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:55:26,608 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 [2022-12-13 11:55:26,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:55:26,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:55:26,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:55:26,910 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:55:26,911 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:55:26,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix050.i [2022-12-13 11:55:27,970 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:55:28,206 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:55:28,206 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix050.i [2022-12-13 11:55:28,218 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c115efb/6a4f4a7a38d142318102e890dd7c5bac/FLAG9510d1782 [2022-12-13 11:55:28,227 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c115efb/6a4f4a7a38d142318102e890dd7c5bac [2022-12-13 11:55:28,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:55:28,230 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:55:28,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:55:28,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:55:28,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:55:28,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:55:28" (1/1) ... [2022-12-13 11:55:28,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae5bd9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:28, skipping insertion in model container [2022-12-13 11:55:28,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:55:28" (1/1) ... [2022-12-13 11:55:28,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:55:28,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:55:28,375 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/mix050.i[940,953] [2022-12-13 11:55:28,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:55:28,489 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:55:28,499 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/mix050.i[940,953] [2022-12-13 11:55:28,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:28,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:28,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:55:28,564 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:55:28,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:28 WrapperNode [2022-12-13 11:55:28,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:55:28,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:55:28,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:55:28,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:55:28,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:28" (1/1) ... [2022-12-13 11:55:28,581 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:28" (1/1) ... [2022-12-13 11:55:28,598 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-13 11:55:28,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:55:28,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:55:28,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:55:28,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:55:28,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:28" (1/1) ... [2022-12-13 11:55:28,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:28" (1/1) ... [2022-12-13 11:55:28,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:28" (1/1) ... [2022-12-13 11:55:28,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:28" (1/1) ... [2022-12-13 11:55:28,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:28" (1/1) ... [2022-12-13 11:55:28,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:28" (1/1) ... [2022-12-13 11:55:28,637 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:28" (1/1) ... [2022-12-13 11:55:28,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:28" (1/1) ... [2022-12-13 11:55:28,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:55:28,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:55:28,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:55:28,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:55:28,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:28" (1/1) ... [2022-12-13 11:55:28,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:55:28,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:55:28,676 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-13 11:55:28,733 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-13 11:55:28,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:55:28,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:55:28,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:55:28,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:55:28,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:55:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:55:28,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:55:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:55:28,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:55:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:55:28,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:55:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 11:55:28,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 11:55:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:55:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:55:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:55:28,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:55:28,749 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:55:28,885 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:55:28,886 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:55:29,175 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:55:29,279 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:55:29,279 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:55:29,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:55:29 BoogieIcfgContainer [2022-12-13 11:55:29,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:55:29,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:55:29,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:55:29,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:55:29,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:55:28" (1/3) ... [2022-12-13 11:55:29,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dda5c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:55:29, skipping insertion in model container [2022-12-13 11:55:29,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:28" (2/3) ... [2022-12-13 11:55:29,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dda5c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:55:29, skipping insertion in model container [2022-12-13 11:55:29,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:55:29" (3/3) ... [2022-12-13 11:55:29,290 INFO L112 eAbstractionObserver]: Analyzing ICFG mix050.i [2022-12-13 11:55:29,302 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:55:29,303 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:55:29,303 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:55:29,353 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:55:29,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 11:55:29,442 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 11:55:29,442 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:55:29,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 11:55:29,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 11:55:29,452 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-13 11:55:29,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:29,476 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 11:55:29,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-13 11:55:29,516 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 11:55:29,516 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:55:29,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 11:55:29,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 11:55:29,521 INFO L226 LiptonReduction]: Number of co-enabled transitions 3058 [2022-12-13 11:55:33,196 INFO L241 LiptonReduction]: Total number of compositions: 97 [2022-12-13 11:55:33,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:55:33,210 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=REPEATED_LIPTON_PN, 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;@38489844, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:55:33,210 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 11:55:33,212 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 11:55:33,212 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:55:33,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:33,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 11:55:33,213 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:33,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:33,216 INFO L85 PathProgramCache]: Analyzing trace with hash 569586, now seen corresponding path program 1 times [2022-12-13 11:55:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:33,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142970569] [2022-12-13 11:55:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:33,450 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-13 11:55:33,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:33,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142970569] [2022-12-13 11:55:33,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142970569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:33,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:33,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:55:33,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797382445] [2022-12-13 11:55:33,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:33,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:55:33,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:33,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:55:33,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:55:33,488 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 82 [2022-12-13 11:55:33,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 82 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-13 11:55:33,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:33,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 82 [2022-12-13 11:55:33,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:39,876 INFO L130 PetriNetUnfolder]: 64365/91269 cut-off events. [2022-12-13 11:55:39,876 INFO L131 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2022-12-13 11:55:40,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176383 conditions, 91269 events. 64365/91269 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 4099. Compared 668438 event pairs, 25697 based on Foata normal form. 0/59429 useless extension candidates. Maximal degree in co-relation 176371. Up to 71105 conditions per place. [2022-12-13 11:55:40,212 INFO L137 encePairwiseOnDemand]: 77/82 looper letters, 48 selfloop transitions, 2 changer transitions 70/135 dead transitions. [2022-12-13 11:55:40,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 135 transitions, 527 flow [2022-12-13 11:55:40,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:55:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:55:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-12-13 11:55:40,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2022-12-13 11:55:40,225 INFO L175 Difference]: Start difference. First operand has 94 places, 82 transitions, 176 flow. Second operand 3 states and 174 transitions. [2022-12-13 11:55:40,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 135 transitions, 527 flow [2022-12-13 11:55:40,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 135 transitions, 520 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:55:40,233 INFO L231 Difference]: Finished difference. Result has 90 places, 43 transitions, 98 flow [2022-12-13 11:55:40,234 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=90, PETRI_TRANSITIONS=43} [2022-12-13 11:55:40,238 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -4 predicate places. [2022-12-13 11:55:40,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:55:40,239 INFO L89 Accepts]: Start accepts. Operand has 90 places, 43 transitions, 98 flow [2022-12-13 11:55:40,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:55:40,243 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:40,243 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 43 transitions, 98 flow [2022-12-13 11:55:40,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 98 flow [2022-12-13 11:55:40,261 INFO L130 PetriNetUnfolder]: 0/43 cut-off events. [2022-12-13 11:55:40,261 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:55:40,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:55:40,265 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 98 flow [2022-12-13 11:55:40,266 INFO L226 LiptonReduction]: Number of co-enabled transitions 1106 [2022-12-13 11:55:40,765 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:55:40,768 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 530 [2022-12-13 11:55:40,768 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 98 flow [2022-12-13 11:55:40,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-13 11:55:40,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:40,768 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:55:40,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:55:40,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:40,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1460311357, now seen corresponding path program 1 times [2022-12-13 11:55:40,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:40,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438377817] [2022-12-13 11:55:40,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:40,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:40,994 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-13 11:55:40,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:40,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438377817] [2022-12-13 11:55:40,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438377817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:40,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:40,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:55:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305365461] [2022-12-13 11:55:40,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:40,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:55:40,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:40,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:55:40,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:55:40,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 11:55:40,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-13 11:55:40,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:40,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 11:55:40,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:42,571 INFO L130 PetriNetUnfolder]: 17897/24756 cut-off events. [2022-12-13 11:55:42,571 INFO L131 PetriNetUnfolder]: For 985/985 co-relation queries the response was YES. [2022-12-13 11:55:42,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50402 conditions, 24756 events. 17897/24756 cut-off events. For 985/985 co-relation queries the response was YES. Maximal size of possible extension queue 1110. Compared 144787 event pairs, 5429 based on Foata normal form. 108/17389 useless extension candidates. Maximal degree in co-relation 50392. Up to 23626 conditions per place. [2022-12-13 11:55:42,687 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 46 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2022-12-13 11:55:42,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 278 flow [2022-12-13 11:55:42,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:55:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:55:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-12-13 11:55:42,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2022-12-13 11:55:42,689 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 98 flow. Second operand 3 states and 93 transitions. [2022-12-13 11:55:42,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 278 flow [2022-12-13 11:55:42,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:55:42,690 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 183 flow [2022-12-13 11:55:42,691 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2022-12-13 11:55:42,691 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -39 predicate places. [2022-12-13 11:55:42,692 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:55:42,692 INFO L89 Accepts]: Start accepts. Operand has 55 places, 55 transitions, 183 flow [2022-12-13 11:55:42,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:55:42,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:42,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 55 transitions, 183 flow [2022-12-13 11:55:42,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 183 flow [2022-12-13 11:55:42,798 INFO L130 PetriNetUnfolder]: 1269/2544 cut-off events. [2022-12-13 11:55:42,799 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:55:42,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4347 conditions, 2544 events. 1269/2544 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 20732 event pairs, 783 based on Foata normal form. 0/1259 useless extension candidates. Maximal degree in co-relation 4339. Up to 1780 conditions per place. [2022-12-13 11:55:42,820 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 55 transitions, 183 flow [2022-12-13 11:55:42,821 INFO L226 LiptonReduction]: Number of co-enabled transitions 1376 [2022-12-13 11:55:42,978 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:55:42,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 287 [2022-12-13 11:55:42,980 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 183 flow [2022-12-13 11:55:42,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-13 11:55:42,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:42,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:55:42,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:55:42,981 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:42,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1433209033, now seen corresponding path program 1 times [2022-12-13 11:55:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:42,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551488730] [2022-12-13 11:55:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:42,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:43,146 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-13 11:55:43,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:43,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551488730] [2022-12-13 11:55:43,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551488730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:43,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:43,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:55:43,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673020193] [2022-12-13 11:55:43,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:43,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:55:43,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:43,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:55:43,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:55:43,150 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 11:55:43,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-13 11:55:43,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:43,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 11:55:43,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:44,347 INFO L130 PetriNetUnfolder]: 11984/17682 cut-off events. [2022-12-13 11:55:44,347 INFO L131 PetriNetUnfolder]: For 879/879 co-relation queries the response was YES. [2022-12-13 11:55:44,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44596 conditions, 17682 events. 11984/17682 cut-off events. For 879/879 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 113072 event pairs, 1946 based on Foata normal form. 405/12880 useless extension candidates. Maximal degree in co-relation 44585. Up to 14608 conditions per place. [2022-12-13 11:55:44,438 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 59 selfloop transitions, 25 changer transitions 0/95 dead transitions. [2022-12-13 11:55:44,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 95 transitions, 465 flow [2022-12-13 11:55:44,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:55:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:55:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-12-13 11:55:44,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-12-13 11:55:44,440 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 183 flow. Second operand 4 states and 129 transitions. [2022-12-13 11:55:44,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 95 transitions, 465 flow [2022-12-13 11:55:44,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 95 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:55:44,442 INFO L231 Difference]: Finished difference. Result has 58 places, 67 transitions, 318 flow [2022-12-13 11:55:44,442 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=58, PETRI_TRANSITIONS=67} [2022-12-13 11:55:44,443 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -36 predicate places. [2022-12-13 11:55:44,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:55:44,443 INFO L89 Accepts]: Start accepts. Operand has 58 places, 67 transitions, 318 flow [2022-12-13 11:55:44,444 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:55:44,444 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:44,444 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 67 transitions, 318 flow [2022-12-13 11:55:44,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 67 transitions, 318 flow [2022-12-13 11:55:44,569 INFO L130 PetriNetUnfolder]: 1161/2415 cut-off events. [2022-12-13 11:55:44,569 INFO L131 PetriNetUnfolder]: For 30/159 co-relation queries the response was YES. [2022-12-13 11:55:44,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5855 conditions, 2415 events. 1161/2415 cut-off events. For 30/159 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 19442 event pairs, 351 based on Foata normal form. 4/1211 useless extension candidates. Maximal degree in co-relation 5845. Up to 1660 conditions per place. [2022-12-13 11:55:44,588 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 67 transitions, 318 flow [2022-12-13 11:55:44,588 INFO L226 LiptonReduction]: Number of co-enabled transitions 1742 [2022-12-13 11:55:44,650 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:55:44,651 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-13 11:55:44,652 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 67 transitions, 318 flow [2022-12-13 11:55:44,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-13 11:55:44,652 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:44,652 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:55:44,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:55:44,652 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:44,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:44,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1714140269, now seen corresponding path program 1 times [2022-12-13 11:55:44,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:44,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786154496] [2022-12-13 11:55:44,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:44,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:44,802 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-13 11:55:44,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:44,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786154496] [2022-12-13 11:55:44,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786154496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:44,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:44,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:55:44,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897058382] [2022-12-13 11:55:44,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:44,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:55:44,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:44,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:55:44,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:55:44,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 11:55:44,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 67 transitions, 318 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-13 11:55:44,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:44,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 11:55:44,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:45,521 INFO L130 PetriNetUnfolder]: 6476/10257 cut-off events. [2022-12-13 11:55:45,522 INFO L131 PetriNetUnfolder]: For 1707/1707 co-relation queries the response was YES. [2022-12-13 11:55:45,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32169 conditions, 10257 events. 6476/10257 cut-off events. For 1707/1707 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 67103 event pairs, 569 based on Foata normal form. 567/7723 useless extension candidates. Maximal degree in co-relation 32156. Up to 5047 conditions per place. [2022-12-13 11:55:45,578 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 70 selfloop transitions, 37 changer transitions 0/118 dead transitions. [2022-12-13 11:55:45,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 118 transitions, 694 flow [2022-12-13 11:55:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:55:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:55:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2022-12-13 11:55:45,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7581395348837209 [2022-12-13 11:55:45,580 INFO L175 Difference]: Start difference. First operand has 58 places, 67 transitions, 318 flow. Second operand 5 states and 163 transitions. [2022-12-13 11:55:45,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 118 transitions, 694 flow [2022-12-13 11:55:45,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 118 transitions, 644 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 11:55:45,588 INFO L231 Difference]: Finished difference. Result has 61 places, 79 transitions, 464 flow [2022-12-13 11:55:45,588 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=464, PETRI_PLACES=61, PETRI_TRANSITIONS=79} [2022-12-13 11:55:45,588 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -33 predicate places. [2022-12-13 11:55:45,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:55:45,588 INFO L89 Accepts]: Start accepts. Operand has 61 places, 79 transitions, 464 flow [2022-12-13 11:55:45,589 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:55:45,589 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:45,589 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 79 transitions, 464 flow [2022-12-13 11:55:45,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 79 transitions, 464 flow [2022-12-13 11:55:45,694 INFO L130 PetriNetUnfolder]: 837/1875 cut-off events. [2022-12-13 11:55:45,694 INFO L131 PetriNetUnfolder]: For 192/321 co-relation queries the response was YES. [2022-12-13 11:55:45,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5949 conditions, 1875 events. 837/1875 cut-off events. For 192/321 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 14840 event pairs, 81 based on Foata normal form. 4/941 useless extension candidates. Maximal degree in co-relation 5938. Up to 1270 conditions per place. [2022-12-13 11:55:45,707 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 79 transitions, 464 flow [2022-12-13 11:55:45,707 INFO L226 LiptonReduction]: Number of co-enabled transitions 1766 [2022-12-13 11:55:45,724 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:55:45,728 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 11:55:45,729 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 79 transitions, 464 flow [2022-12-13 11:55:45,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-13 11:55:45,729 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:45,729 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] [2022-12-13 11:55:45,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:55:45,729 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:45,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:45,729 INFO L85 PathProgramCache]: Analyzing trace with hash 269975651, now seen corresponding path program 1 times [2022-12-13 11:55:45,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:45,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259880613] [2022-12-13 11:55:45,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:45,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:45,943 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-13 11:55:45,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:45,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259880613] [2022-12-13 11:55:45,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259880613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:45,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:45,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:55:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096053491] [2022-12-13 11:55:45,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:45,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:55:45,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:45,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:55:45,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:55:45,945 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 11:55:45,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 79 transitions, 464 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-13 11:55:45,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:45,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 11:55:45,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:46,507 INFO L130 PetriNetUnfolder]: 4775/7233 cut-off events. [2022-12-13 11:55:46,507 INFO L131 PetriNetUnfolder]: For 1962/1962 co-relation queries the response was YES. [2022-12-13 11:55:46,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25696 conditions, 7233 events. 4775/7233 cut-off events. For 1962/1962 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 41201 event pairs, 326 based on Foata normal form. 351/5131 useless extension candidates. Maximal degree in co-relation 25682. Up to 3115 conditions per place. [2022-12-13 11:55:46,542 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 58 selfloop transitions, 49 changer transitions 1/118 dead transitions. [2022-12-13 11:55:46,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 118 transitions, 768 flow [2022-12-13 11:55:46,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:55:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:55:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2022-12-13 11:55:46,544 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2022-12-13 11:55:46,544 INFO L175 Difference]: Start difference. First operand has 61 places, 79 transitions, 464 flow. Second operand 6 states and 174 transitions. [2022-12-13 11:55:46,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 118 transitions, 768 flow [2022-12-13 11:55:46,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 118 transitions, 670 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-13 11:55:46,702 INFO L231 Difference]: Finished difference. Result has 64 places, 78 transitions, 488 flow [2022-12-13 11:55:46,702 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=64, PETRI_TRANSITIONS=78} [2022-12-13 11:55:46,703 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -30 predicate places. [2022-12-13 11:55:46,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:55:46,703 INFO L89 Accepts]: Start accepts. Operand has 64 places, 78 transitions, 488 flow [2022-12-13 11:55:46,704 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:55:46,704 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:46,704 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 78 transitions, 488 flow [2022-12-13 11:55:46,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 78 transitions, 488 flow [2022-12-13 11:55:46,744 INFO L130 PetriNetUnfolder]: 513/1038 cut-off events. [2022-12-13 11:55:46,744 INFO L131 PetriNetUnfolder]: For 517/628 co-relation queries the response was YES. [2022-12-13 11:55:46,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 1038 events. 513/1038 cut-off events. For 517/628 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 6382 event pairs, 0 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 3994. Up to 730 conditions per place. [2022-12-13 11:55:46,750 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 78 transitions, 488 flow [2022-12-13 11:55:46,750 INFO L226 LiptonReduction]: Number of co-enabled transitions 1566 [2022-12-13 11:55:47,126 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:55:47,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 424 [2022-12-13 11:55:47,127 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 76 transitions, 484 flow [2022-12-13 11:55:47,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-13 11:55:47,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:47,127 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] [2022-12-13 11:55:47,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:55:47,128 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:47,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:47,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1329210303, now seen corresponding path program 1 times [2022-12-13 11:55:47,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:47,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610834932] [2022-12-13 11:55:47,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:47,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:47,893 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-13 11:55:47,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:47,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610834932] [2022-12-13 11:55:47,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610834932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:47,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:47,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:55:47,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926482117] [2022-12-13 11:55:47,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:47,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:55:47,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:47,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:55:47,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:55:47,895 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2022-12-13 11:55:47,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 76 transitions, 484 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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-13 11:55:47,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:47,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2022-12-13 11:55:47,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:48,866 INFO L130 PetriNetUnfolder]: 7672/11531 cut-off events. [2022-12-13 11:55:48,866 INFO L131 PetriNetUnfolder]: For 13662/14625 co-relation queries the response was YES. [2022-12-13 11:55:48,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43520 conditions, 11531 events. 7672/11531 cut-off events. For 13662/14625 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 73721 event pairs, 404 based on Foata normal form. 443/9199 useless extension candidates. Maximal degree in co-relation 43505. Up to 4259 conditions per place. [2022-12-13 11:55:48,940 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 158 selfloop transitions, 6 changer transitions 28/218 dead transitions. [2022-12-13 11:55:48,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 218 transitions, 1796 flow [2022-12-13 11:55:48,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:55:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:55:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2022-12-13 11:55:48,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7541666666666667 [2022-12-13 11:55:48,942 INFO L175 Difference]: Start difference. First operand has 61 places, 76 transitions, 484 flow. Second operand 6 states and 181 transitions. [2022-12-13 11:55:48,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 218 transitions, 1796 flow [2022-12-13 11:55:49,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 218 transitions, 1398 flow, removed 84 selfloop flow, removed 4 redundant places. [2022-12-13 11:55:49,818 INFO L231 Difference]: Finished difference. Result has 65 places, 80 transitions, 383 flow [2022-12-13 11:55:49,818 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=65, PETRI_TRANSITIONS=80} [2022-12-13 11:55:49,818 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -29 predicate places. [2022-12-13 11:55:49,819 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:55:49,819 INFO L89 Accepts]: Start accepts. Operand has 65 places, 80 transitions, 383 flow [2022-12-13 11:55:49,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:55:49,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:49,820 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 80 transitions, 383 flow [2022-12-13 11:55:49,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 80 transitions, 383 flow [2022-12-13 11:55:49,954 INFO L130 PetriNetUnfolder]: 1757/2719 cut-off events. [2022-12-13 11:55:49,954 INFO L131 PetriNetUnfolder]: For 2581/2739 co-relation queries the response was YES. [2022-12-13 11:55:49,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7793 conditions, 2719 events. 1757/2719 cut-off events. For 2581/2739 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 16876 event pairs, 2 based on Foata normal form. 6/910 useless extension candidates. Maximal degree in co-relation 7778. Up to 1297 conditions per place. [2022-12-13 11:55:49,973 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 80 transitions, 383 flow [2022-12-13 11:55:49,973 INFO L226 LiptonReduction]: Number of co-enabled transitions 1770 [2022-12-13 11:55:49,997 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:55:49,998 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-13 11:55:49,998 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 80 transitions, 383 flow [2022-12-13 11:55:49,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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-13 11:55:49,998 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:49,998 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] [2022-12-13 11:55:49,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:55:49,999 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:49,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:49,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1341756809, now seen corresponding path program 1 times [2022-12-13 11:55:49,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:49,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706396725] [2022-12-13 11:55:49,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:49,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:50,153 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-13 11:55:50,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:50,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706396725] [2022-12-13 11:55:50,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706396725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:50,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:50,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:55:50,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963225770] [2022-12-13 11:55:50,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:50,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:55:50,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:50,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:55:50,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:55:50,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2022-12-13 11:55:50,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 80 transitions, 383 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-13 11:55:50,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:50,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2022-12-13 11:55:50,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:51,711 INFO L130 PetriNetUnfolder]: 17638/26004 cut-off events. [2022-12-13 11:55:51,711 INFO L131 PetriNetUnfolder]: For 23352/24779 co-relation queries the response was YES. [2022-12-13 11:55:51,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83672 conditions, 26004 events. 17638/26004 cut-off events. For 23352/24779 co-relation queries the response was YES. Maximal size of possible extension queue 1397. Compared 178080 event pairs, 1049 based on Foata normal form. 998/21059 useless extension candidates. Maximal degree in co-relation 83654. Up to 13286 conditions per place. [2022-12-13 11:55:51,865 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 121 selfloop transitions, 5 changer transitions 11/160 dead transitions. [2022-12-13 11:55:51,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 160 transitions, 1039 flow [2022-12-13 11:55:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:55:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:55:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-12-13 11:55:51,866 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7125 [2022-12-13 11:55:51,866 INFO L175 Difference]: Start difference. First operand has 65 places, 80 transitions, 383 flow. Second operand 4 states and 114 transitions. [2022-12-13 11:55:51,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 160 transitions, 1039 flow [2022-12-13 11:55:55,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 160 transitions, 1032 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:55:55,088 INFO L231 Difference]: Finished difference. Result has 68 places, 83 transitions, 413 flow [2022-12-13 11:55:55,088 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=413, PETRI_PLACES=68, PETRI_TRANSITIONS=83} [2022-12-13 11:55:55,091 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -26 predicate places. [2022-12-13 11:55:55,091 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:55:55,091 INFO L89 Accepts]: Start accepts. Operand has 68 places, 83 transitions, 413 flow [2022-12-13 11:55:55,092 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:55:55,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:55,093 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 83 transitions, 413 flow [2022-12-13 11:55:55,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 83 transitions, 413 flow [2022-12-13 11:55:55,303 INFO L130 PetriNetUnfolder]: 3559/5511 cut-off events. [2022-12-13 11:55:55,303 INFO L131 PetriNetUnfolder]: For 4467/4901 co-relation queries the response was YES. [2022-12-13 11:55:55,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15644 conditions, 5511 events. 3559/5511 cut-off events. For 4467/4901 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 38893 event pairs, 15 based on Foata normal form. 21/1782 useless extension candidates. Maximal degree in co-relation 15628. Up to 2593 conditions per place. [2022-12-13 11:55:55,346 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 83 transitions, 413 flow [2022-12-13 11:55:55,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 1962 [2022-12-13 11:55:55,358 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:55:55,358 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-13 11:55:55,358 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 83 transitions, 413 flow [2022-12-13 11:55:55,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-13 11:55:55,358 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:55,359 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] [2022-12-13 11:55:55,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:55:55,359 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:55,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash -923090773, now seen corresponding path program 2 times [2022-12-13 11:55:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:55,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103804363] [2022-12-13 11:55:55,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:55,511 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-13 11:55:55,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:55,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103804363] [2022-12-13 11:55:55,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103804363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:55,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:55,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:55:55,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016274115] [2022-12-13 11:55:55,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:55,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:55:55,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:55,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:55:55,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:55:55,513 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2022-12-13 11:55:55,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 83 transitions, 413 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-13 11:55:55,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:55,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2022-12-13 11:55:55,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:57,624 INFO L130 PetriNetUnfolder]: 22606/34370 cut-off events. [2022-12-13 11:55:57,624 INFO L131 PetriNetUnfolder]: For 36842/38667 co-relation queries the response was YES. [2022-12-13 11:55:57,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114481 conditions, 34370 events. 22606/34370 cut-off events. For 36842/38667 co-relation queries the response was YES. Maximal size of possible extension queue 1927. Compared 257686 event pairs, 1911 based on Foata normal form. 1148/27258 useless extension candidates. Maximal degree in co-relation 114462. Up to 12985 conditions per place. [2022-12-13 11:55:57,827 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 115 selfloop transitions, 3 changer transitions 14/159 dead transitions. [2022-12-13 11:55:57,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 159 transitions, 1070 flow [2022-12-13 11:55:57,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:55:57,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:55:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-12-13 11:55:57,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.70625 [2022-12-13 11:55:57,829 INFO L175 Difference]: Start difference. First operand has 67 places, 83 transitions, 413 flow. Second operand 4 states and 113 transitions. [2022-12-13 11:55:57,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 159 transitions, 1070 flow [2022-12-13 11:56:05,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 159 transitions, 1066 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 11:56:05,332 INFO L231 Difference]: Finished difference. Result has 70 places, 85 transitions, 439 flow [2022-12-13 11:56:05,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=439, PETRI_PLACES=70, PETRI_TRANSITIONS=85} [2022-12-13 11:56:05,333 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -24 predicate places. [2022-12-13 11:56:05,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:05,333 INFO L89 Accepts]: Start accepts. Operand has 70 places, 85 transitions, 439 flow [2022-12-13 11:56:05,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:05,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:05,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 85 transitions, 439 flow [2022-12-13 11:56:05,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 85 transitions, 439 flow [2022-12-13 11:56:06,206 INFO L130 PetriNetUnfolder]: 5972/9424 cut-off events. [2022-12-13 11:56:06,206 INFO L131 PetriNetUnfolder]: For 5904/6211 co-relation queries the response was YES. [2022-12-13 11:56:06,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26408 conditions, 9424 events. 5972/9424 cut-off events. For 5904/6211 co-relation queries the response was YES. Maximal size of possible extension queue 1521. Compared 74512 event pairs, 24 based on Foata normal form. 21/2929 useless extension candidates. Maximal degree in co-relation 26391. Up to 4456 conditions per place. [2022-12-13 11:56:06,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 85 transitions, 439 flow [2022-12-13 11:56:06,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 2042 [2022-12-13 11:56:06,284 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:06,285 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 952 [2022-12-13 11:56:06,285 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 85 transitions, 439 flow [2022-12-13 11:56:06,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-13 11:56:06,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:06,286 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] [2022-12-13 11:56:06,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:56:06,286 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:56:06,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:06,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1073789543, now seen corresponding path program 3 times [2022-12-13 11:56:06,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:06,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708306780] [2022-12-13 11:56:06,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:06,518 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-13 11:56:06,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:06,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708306780] [2022-12-13 11:56:06,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708306780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:06,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:06,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:56:06,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032261933] [2022-12-13 11:56:06,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:06,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:56:06,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:06,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:56:06,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:56:06,520 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2022-12-13 11:56:06,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 85 transitions, 439 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-13 11:56:06,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:06,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2022-12-13 11:56:06,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:10,726 INFO L130 PetriNetUnfolder]: 39658/58752 cut-off events. [2022-12-13 11:56:10,726 INFO L131 PetriNetUnfolder]: For 70343/74058 co-relation queries the response was YES. [2022-12-13 11:56:10,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202331 conditions, 58752 events. 39658/58752 cut-off events. For 70343/74058 co-relation queries the response was YES. Maximal size of possible extension queue 3576. Compared 447905 event pairs, 5493 based on Foata normal form. 2052/46938 useless extension candidates. Maximal degree in co-relation 202311. Up to 23014 conditions per place. [2022-12-13 11:56:11,022 INFO L137 encePairwiseOnDemand]: 29/40 looper letters, 155 selfloop transitions, 27 changer transitions 50/255 dead transitions. [2022-12-13 11:56:11,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 255 transitions, 1826 flow [2022-12-13 11:56:11,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:56:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 11:56:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2022-12-13 11:56:11,023 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.621875 [2022-12-13 11:56:11,023 INFO L175 Difference]: Start difference. First operand has 70 places, 85 transitions, 439 flow. Second operand 8 states and 199 transitions. [2022-12-13 11:56:11,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 255 transitions, 1826 flow [2022-12-13 11:56:34,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 255 transitions, 1822 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:56:34,733 INFO L231 Difference]: Finished difference. Result has 81 places, 107 transitions, 675 flow [2022-12-13 11:56:34,733 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=675, PETRI_PLACES=81, PETRI_TRANSITIONS=107} [2022-12-13 11:56:34,734 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -13 predicate places. [2022-12-13 11:56:34,734 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:34,736 INFO L89 Accepts]: Start accepts. Operand has 81 places, 107 transitions, 675 flow [2022-12-13 11:56:34,740 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:34,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:34,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 107 transitions, 675 flow [2022-12-13 11:56:34,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 107 transitions, 675 flow [2022-12-13 11:56:35,372 INFO L130 PetriNetUnfolder]: 7699/12683 cut-off events. [2022-12-13 11:56:35,372 INFO L131 PetriNetUnfolder]: For 11691/12768 co-relation queries the response was YES. [2022-12-13 11:56:35,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37660 conditions, 12683 events. 7699/12683 cut-off events. For 11691/12768 co-relation queries the response was YES. Maximal size of possible extension queue 1758. Compared 103847 event pairs, 72 based on Foata normal form. 79/4234 useless extension candidates. Maximal degree in co-relation 37637. Up to 5617 conditions per place. [2022-12-13 11:56:35,474 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 107 transitions, 675 flow [2022-12-13 11:56:35,474 INFO L226 LiptonReduction]: Number of co-enabled transitions 2864 [2022-12-13 11:56:39,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L766-->L773: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_107 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= 0 (mod v_~a$r_buff0_thd1~0_27 256))))) (let ((.cse0 (and (not (= 0 (mod v_~a$w_buff0_used~0_108 256))) .cse5)) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_93 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~a~0_58 (ite .cse0 v_~a$w_buff0~0_34 (ite .cse1 v_~a$w_buff1~0_29 v_~a~0_59))) (= (ite .cse0 0 v_~a$w_buff0_used~0_108) v_~a$w_buff0_used~0_107) (= v_~a$r_buff0_thd1~0_26 (ite .cse2 0 v_~a$r_buff0_thd1~0_27)) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_92 256) 0))) (and .cse4 (not (= (mod v_~a$r_buff0_thd1~0_26 256) 0)))) 0 v_~a$r_buff1_thd1~0_18) v_~a$r_buff1_thd1~0_17) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_93) v_~a$w_buff1_used~0_92)))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_29, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_108, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_93} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_29, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_107, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_92} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [562] L870-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~a$r_buff1_thd0~0_173 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_577 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_180 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_578 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_518 256) 0)) .cse4))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_578) v_~a$w_buff0_used~0_577) (= (ite (= (ite (= v_~__unbuffered_cnt~0_925 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_122) (= (mod v_~main$tmp_guard0~0_122 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|) (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_124 0) (= v_~__unbuffered_p0_EAX~0_86 0) (= v_~__unbuffered_p1_EAX~0_82 0) (= v_~__unbuffered_p2_EAX~0_82 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_118) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_99| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_95| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_99|) (= v_~a$r_buff0_thd0~0_179 (ite .cse1 0 v_~a$r_buff0_thd0~0_180)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_518) v_~a$w_buff1_used~0_517) (= (mod v_~main$tmp_guard1~0_118 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_95|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= v_~a$r_buff1_thd0~0_172 (ite (or (and .cse3 (not (= (mod v_~a$r_buff0_thd0~0_179 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_517 256) 0)) .cse4)) 0 v_~a$r_buff1_thd0~0_173)) (= v_~a~0_446 (ite .cse0 v_~a$w_buff0~0_350 (ite .cse2 v_~a$w_buff1~0_292 v_~a~0_447)))))) InVars {~a~0=v_~a~0_447, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~a$w_buff1~0=v_~a$w_buff1~0_292, ~a$w_buff0~0=v_~a$w_buff0~0_350, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_124, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_173, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_578, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_925, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_180, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_518} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_99|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_131|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_577, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_118, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_179, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_122, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_115|, ~a~0=v_~a~0_446, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_95|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~a$w_buff1~0=v_~a$w_buff1~0_292, ~a$w_buff0~0=v_~a$w_buff0~0_350, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_124, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_172, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_925, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_517, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:56:39,296 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L766-->L773: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_107 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= 0 (mod v_~a$r_buff0_thd1~0_27 256))))) (let ((.cse0 (and (not (= 0 (mod v_~a$w_buff0_used~0_108 256))) .cse5)) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_93 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~a~0_58 (ite .cse0 v_~a$w_buff0~0_34 (ite .cse1 v_~a$w_buff1~0_29 v_~a~0_59))) (= (ite .cse0 0 v_~a$w_buff0_used~0_108) v_~a$w_buff0_used~0_107) (= v_~a$r_buff0_thd1~0_26 (ite .cse2 0 v_~a$r_buff0_thd1~0_27)) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_92 256) 0))) (and .cse4 (not (= (mod v_~a$r_buff0_thd1~0_26 256) 0)))) 0 v_~a$r_buff1_thd1~0_18) v_~a$r_buff1_thd1~0_17) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_93) v_~a$w_buff1_used~0_92)))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_29, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_108, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_93} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_29, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_107, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_92} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [562] L870-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~a$r_buff1_thd0~0_173 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_577 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_180 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_578 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_518 256) 0)) .cse4))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_578) v_~a$w_buff0_used~0_577) (= (ite (= (ite (= v_~__unbuffered_cnt~0_925 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_122) (= (mod v_~main$tmp_guard0~0_122 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|) (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_124 0) (= v_~__unbuffered_p0_EAX~0_86 0) (= v_~__unbuffered_p1_EAX~0_82 0) (= v_~__unbuffered_p2_EAX~0_82 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_118) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_99| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_95| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_99|) (= v_~a$r_buff0_thd0~0_179 (ite .cse1 0 v_~a$r_buff0_thd0~0_180)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_518) v_~a$w_buff1_used~0_517) (= (mod v_~main$tmp_guard1~0_118 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_95|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= v_~a$r_buff1_thd0~0_172 (ite (or (and .cse3 (not (= (mod v_~a$r_buff0_thd0~0_179 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_517 256) 0)) .cse4)) 0 v_~a$r_buff1_thd0~0_173)) (= v_~a~0_446 (ite .cse0 v_~a$w_buff0~0_350 (ite .cse2 v_~a$w_buff1~0_292 v_~a~0_447)))))) InVars {~a~0=v_~a~0_447, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~a$w_buff1~0=v_~a$w_buff1~0_292, ~a$w_buff0~0=v_~a$w_buff0~0_350, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_124, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_173, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_578, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_925, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_180, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_518} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_99|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_131|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_577, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_118, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_179, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_122, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_115|, ~a~0=v_~a~0_446, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_95|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~a$w_buff1~0=v_~a$w_buff1~0_292, ~a$w_buff0~0=v_~a$w_buff0~0_350, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_124, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_172, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_925, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_517, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:56:39,567 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:56:39,568 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4834 [2022-12-13 11:56:39,568 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 105 transitions, 705 flow [2022-12-13 11:56:39,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-13 11:56:39,569 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:39,569 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] [2022-12-13 11:56:39,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:56:39,569 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:56:39,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:39,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1737720038, now seen corresponding path program 1 times [2022-12-13 11:56:39,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:39,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543900870] [2022-12-13 11:56:39,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:39,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:56:39,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:56:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:56:39,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:56:39,669 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:56:39,670 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 11:56:39,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 11:56:39,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 11:56:39,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 11:56:39,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 11:56:39,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 11:56:39,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 11:56:39,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:56:39,672 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:39,676 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:56:39,676 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:56:39,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:56:39 BasicIcfg [2022-12-13 11:56:39,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:56:39,757 INFO L158 Benchmark]: Toolchain (without parser) took 71527.60ms. Allocated memory was 177.2MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 152.4MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-13 11:56:39,757 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:56:39,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.29ms. Allocated memory is still 177.2MB. Free memory was 152.4MB in the beginning and 124.5MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 11:56:39,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.13ms. Allocated memory is still 177.2MB. Free memory was 124.5MB in the beginning and 122.0MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:56:39,758 INFO L158 Benchmark]: Boogie Preprocessor took 41.67ms. Allocated memory is still 177.2MB. Free memory was 122.0MB in the beginning and 119.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:56:39,758 INFO L158 Benchmark]: RCFGBuilder took 641.70ms. Allocated memory is still 177.2MB. Free memory was 119.9MB in the beginning and 126.2MB in the end (delta: -6.3MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2022-12-13 11:56:39,758 INFO L158 Benchmark]: TraceAbstraction took 70471.63ms. Allocated memory was 177.2MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 124.6MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-13 11:56:39,759 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.09ms. Allocated memory is still 127.9MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 334.29ms. Allocated memory is still 177.2MB. Free memory was 152.4MB in the beginning and 124.5MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.13ms. Allocated memory is still 177.2MB. Free memory was 124.5MB in the beginning and 122.0MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.67ms. Allocated memory is still 177.2MB. Free memory was 122.0MB in the beginning and 119.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 641.70ms. Allocated memory is still 177.2MB. Free memory was 119.9MB in the beginning and 126.2MB in the end (delta: -6.3MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * TraceAbstraction took 70471.63ms. Allocated memory was 177.2MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 124.6MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 137 PlacesBefore, 94 PlacesAfterwards, 126 TransitionsBefore, 82 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 51 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5131, independent: 4950, independent conditional: 4950, independent unconditional: 0, dependent: 181, dependent conditional: 181, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5131, independent: 4950, independent conditional: 0, independent unconditional: 4950, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5131, independent: 4950, independent conditional: 0, independent unconditional: 4950, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5131, independent: 4950, independent conditional: 0, independent unconditional: 4950, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2710, independent: 2648, independent conditional: 0, independent unconditional: 2648, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2710, independent: 2601, independent conditional: 0, independent unconditional: 2601, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 109, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 296, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 262, dependent conditional: 0, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5131, independent: 2302, independent conditional: 0, independent unconditional: 2302, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 2710, unknown conditional: 0, unknown unconditional: 2710] , Statistics on independence cache: Total cache size (in pairs): 5126, Positive cache size: 5064, Positive conditional cache size: 0, Positive unconditional cache size: 5064, Negative cache size: 62, Negative conditional cache size: 0, Negative unconditional cache size: 62, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 54 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 1106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 440, independent: 394, independent conditional: 394, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 440, independent: 394, independent conditional: 19, independent unconditional: 375, dependent: 46, dependent conditional: 7, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 440, independent: 394, independent conditional: 19, independent unconditional: 375, dependent: 46, dependent conditional: 7, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 440, independent: 394, independent conditional: 19, independent unconditional: 375, dependent: 46, dependent conditional: 7, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 403, independent: 371, independent conditional: 19, independent unconditional: 352, dependent: 32, dependent conditional: 4, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 403, independent: 290, independent conditional: 0, independent unconditional: 290, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 113, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 32, dependent conditional: 4, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 492, independent: 369, independent conditional: 0, independent unconditional: 369, dependent: 123, dependent conditional: 22, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 440, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 14, dependent conditional: 3, dependent unconditional: 11, unknown: 403, unknown conditional: 23, unknown unconditional: 380] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 371, Positive conditional cache size: 19, Positive unconditional cache size: 352, Negative cache size: 32, Negative conditional cache size: 4, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 55 PlacesBefore, 55 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 1376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 260, independent: 216, independent conditional: 216, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 260, independent: 216, independent conditional: 21, independent unconditional: 195, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 260, independent: 216, independent conditional: 21, independent unconditional: 195, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 260, independent: 216, independent conditional: 21, independent unconditional: 195, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 52, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 136, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 260, independent: 175, independent conditional: 21, independent unconditional: 154, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , Statistics on independence cache: Total cache size (in pairs): 455, Positive cache size: 412, Positive conditional cache size: 19, Positive unconditional cache size: 393, Negative cache size: 43, Negative conditional cache size: 4, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 58 PlacesBefore, 58 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1742 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 269, independent: 213, independent conditional: 213, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 269, independent: 213, independent conditional: 9, independent unconditional: 204, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 269, independent: 213, independent conditional: 9, independent unconditional: 204, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 269, independent: 213, independent conditional: 9, independent unconditional: 204, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 269, independent: 202, independent conditional: 9, independent unconditional: 193, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 472, Positive cache size: 423, Positive conditional cache size: 19, Positive unconditional cache size: 404, Negative cache size: 49, Negative conditional cache size: 4, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1766 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 447, independent: 379, independent conditional: 379, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 447, independent: 379, independent conditional: 82, independent unconditional: 297, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 447, independent: 379, independent conditional: 82, independent unconditional: 297, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 447, independent: 379, independent conditional: 82, independent unconditional: 297, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 10, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 447, independent: 357, independent conditional: 72, independent unconditional: 285, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 22, unknown conditional: 10, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 445, Positive conditional cache size: 29, Positive unconditional cache size: 416, Negative cache size: 49, Negative conditional cache size: 4, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 63 PlacesBefore, 61 PlacesAfterwards, 78 TransitionsBefore, 76 TransitionsAfterwards, 1566 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 736, independent: 608, independent conditional: 608, independent unconditional: 0, dependent: 128, dependent conditional: 128, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 736, independent: 608, independent conditional: 42, independent unconditional: 566, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 736, independent: 608, independent conditional: 42, independent unconditional: 566, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 736, independent: 608, independent conditional: 42, independent unconditional: 566, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 736, independent: 608, independent conditional: 42, independent unconditional: 566, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 501, Positive cache size: 452, Positive conditional cache size: 29, Positive unconditional cache size: 423, Negative cache size: 49, Negative conditional cache size: 4, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 247, independent: 208, independent conditional: 208, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 247, independent: 208, independent conditional: 94, independent unconditional: 114, dependent: 39, dependent conditional: 27, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 247, independent: 208, independent conditional: 94, independent unconditional: 114, dependent: 39, dependent conditional: 27, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 247, independent: 208, independent conditional: 94, independent unconditional: 114, dependent: 39, dependent conditional: 27, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 247, independent: 204, independent conditional: 90, independent unconditional: 114, dependent: 35, dependent conditional: 23, dependent unconditional: 12, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 509, Positive cache size: 456, Positive conditional cache size: 33, Positive unconditional cache size: 423, Negative cache size: 53, Negative conditional cache size: 8, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 152, independent: 121, independent conditional: 76, independent unconditional: 45, dependent: 31, dependent conditional: 4, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 121, independent conditional: 74, independent unconditional: 47, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 121, independent conditional: 74, independent unconditional: 47, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, independent: 104, independent conditional: 61, independent unconditional: 43, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 17, unknown conditional: 13, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 526, Positive cache size: 473, Positive conditional cache size: 46, Positive unconditional cache size: 427, Negative cache size: 53, Negative conditional cache size: 8, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 2042 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 168, independent: 141, independent conditional: 141, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 168, independent: 141, independent conditional: 106, independent unconditional: 35, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 168, independent: 141, independent conditional: 104, independent unconditional: 37, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 168, independent: 141, independent conditional: 104, independent unconditional: 37, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 168, independent: 136, independent conditional: 99, independent unconditional: 37, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 531, Positive cache size: 478, Positive conditional cache size: 51, Positive unconditional cache size: 427, Negative cache size: 53, Negative conditional cache size: 8, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 80 PlacesBefore, 79 PlacesAfterwards, 107 TransitionsBefore, 105 TransitionsAfterwards, 2864 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 407, independent: 407, independent conditional: 407, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 407, independent: 407, independent conditional: 335, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 407, independent: 407, independent conditional: 304, independent unconditional: 103, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 407, independent: 407, independent conditional: 304, independent unconditional: 103, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 6, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 407, independent: 393, independent conditional: 298, independent unconditional: 95, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 6, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 717, Positive cache size: 664, Positive conditional cache size: 63, Positive unconditional cache size: 601, Negative cache size: 53, Negative conditional cache size: 8, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L863] 0 pthread_t t1321; [L864] FCALL, FORK 0 pthread_create(&t1321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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(&t1321, ((void *)0), P0, ((void *)0))=-2, t1321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1322; [L866] FCALL, FORK 0 pthread_create(&t1322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1322, ((void *)0), P1, ((void *)0))=-1, t1321={5:0}, t1322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1323; [L868] FCALL, FORK 0 pthread_create(&t1323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1323, ((void *)0), P2, ((void *)0))=0, t1321={5:0}, t1322={6:0}, t1323={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L802] 3 y = 1 [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=0] [L808] 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) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 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 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=0] [L869] 0 pthread_t t1324; [L870] FCALL, FORK 0 pthread_create(&t1324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1324, ((void *)0), P3, ((void *)0))=1, t1321={5:0}, t1322={6:0}, t1323={7:0}, t1324={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, 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] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 a$flush_delayed = weak$$choice2 [L828] 4 a$mem_tmp = a [L829] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L830] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L831] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L832] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L833] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L835] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = a [L837] 4 a = a$flush_delayed ? a$mem_tmp : a [L838] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L841] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L842] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L843] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L844] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L845] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L768] 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) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 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 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L788] 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) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 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 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=0, x=1, y=1, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=0, x=1, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=0, x=1, y=1, z=1] [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=0, x=1, y=1, z=1] [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 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) [L877] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L878] 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 [L879] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L880] 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 [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L885] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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: 866]: 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: 868]: 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: 864]: 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: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 70.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 56.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 486 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 486 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1375 IncrementalHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 18 mSDtfsCounter, 1375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=705occurred in iteration=9, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 905 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-13 11:56:39,788 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...