/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:36:18,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:36:18,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:36:18,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:36:18,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:36:18,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:36:18,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:36:18,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:36:18,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:36:18,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:36:18,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:36:18,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:36:18,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:36:18,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:36:18,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:36:18,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:36:18,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:36:18,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:36:18,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:36:18,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:36:18,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:36:18,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:36:18,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:36:18,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:36:18,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:36:18,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:36:18,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:36:18,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:36:18,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:36:18,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:36:18,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:36:18,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:36:18,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:36:18,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:36:18,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:36:18,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:36:18,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:36:18,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:36:18,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:36:18,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:36:18,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:36:18,575 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-RepeatedSemanticLbe.epf [2022-12-13 00:36:18,611 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:36:18,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:36:18,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:36:18,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:36:18,613 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:36:18,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:36:18,614 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:36:18,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:36:18,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:36:18,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:36:18,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:36:18,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:36:18,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:36:18,615 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:36:18,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:36:18,615 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:36:18,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:36:18,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:36:18,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:36:18,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:36:18,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:36:18,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:36:18,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:36:18,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:36:18,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:36:18,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:36:18,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:36:18,625 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:36:18,625 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 00:36:18,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:36:18,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:36:18,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:36:18,881 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:36:18,887 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:36:18,888 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017.oepc.i [2022-12-13 00:36:19,861 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:36:20,062 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:36:20,063 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017.oepc.i [2022-12-13 00:36:20,089 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6bb27cdd/6c71c87fa59846c291edf4971cd14516/FLAGaee69c939 [2022-12-13 00:36:20,101 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6bb27cdd/6c71c87fa59846c291edf4971cd14516 [2022-12-13 00:36:20,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:36:20,104 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:36:20,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:36:20,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:36:20,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:36:20,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:36:20" (1/1) ... [2022-12-13 00:36:20,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@724f286a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:20, skipping insertion in model container [2022-12-13 00:36:20,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:36:20" (1/1) ... [2022-12-13 00:36:20,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:36:20,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:36:20,298 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/mix017.oepc.i[945,958] [2022-12-13 00:36:20,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:36:20,496 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:36:20,504 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/mix017.oepc.i[945,958] [2022-12-13 00:36:20,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:20,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:20,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:36:20,573 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:36:20,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:20 WrapperNode [2022-12-13 00:36:20,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:36:20,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:36:20,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:36:20,575 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:36:20,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:20" (1/1) ... [2022-12-13 00:36:20,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:20" (1/1) ... [2022-12-13 00:36:20,610 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-13 00:36:20,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:36:20,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:36:20,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:36:20,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:36:20,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:20" (1/1) ... [2022-12-13 00:36:20,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:20" (1/1) ... [2022-12-13 00:36:20,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:20" (1/1) ... [2022-12-13 00:36:20,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:20" (1/1) ... [2022-12-13 00:36:20,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:20" (1/1) ... [2022-12-13 00:36:20,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:20" (1/1) ... [2022-12-13 00:36:20,642 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:20" (1/1) ... [2022-12-13 00:36:20,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:20" (1/1) ... [2022-12-13 00:36:20,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:36:20,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:36:20,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:36:20,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:36:20,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:20" (1/1) ... [2022-12-13 00:36:20,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:36:20,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:36:20,698 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 00:36:20,718 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 00:36:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:36:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:36:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:36:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:36:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:36:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:36:20,728 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:36:20,729 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:36:20,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:36:20,729 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:36:20,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:36:20,729 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 00:36:20,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 00:36:20,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:36:20,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:36:20,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:36:20,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:36:20,731 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 00:36:20,903 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:36:20,905 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:36:21,218 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:36:21,313 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:36:21,313 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:36:21,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:36:21 BoogieIcfgContainer [2022-12-13 00:36:21,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:36:21,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:36:21,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:36:21,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:36:21,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:36:20" (1/3) ... [2022-12-13 00:36:21,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e732cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:36:21, skipping insertion in model container [2022-12-13 00:36:21,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:20" (2/3) ... [2022-12-13 00:36:21,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e732cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:36:21, skipping insertion in model container [2022-12-13 00:36:21,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:36:21" (3/3) ... [2022-12-13 00:36:21,322 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017.oepc.i [2022-12-13 00:36:21,335 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:36:21,335 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:36:21,335 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:36:21,377 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:36:21,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-13 00:36:21,456 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-13 00:36:21,456 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:36:21,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-13 00:36:21,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-13 00:36:21,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-13 00:36:21,468 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:21,483 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-13 00:36:21,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-12-13 00:36:21,514 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-13 00:36:21,515 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:36:21,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-13 00:36:21,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-13 00:36:21,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 3164 [2022-12-13 00:36:26,470 INFO L241 LiptonReduction]: Total number of compositions: 100 [2022-12-13 00:36:26,480 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:36:26,484 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;@40423777, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:36:26,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 00:36:26,487 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-13 00:36:26,487 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:36:26,487 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:26,487 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 00:36:26,488 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 00:36:26,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:26,491 INFO L85 PathProgramCache]: Analyzing trace with hash 570603, now seen corresponding path program 1 times [2022-12-13 00:36:26,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:26,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611509653] [2022-12-13 00:36:26,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:26,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:26,785 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 00:36:26,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:26,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611509653] [2022-12-13 00:36:26,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611509653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:26,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:26,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:36:26,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982656813] [2022-12-13 00:36:26,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:26,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:36:26,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:26,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:36:26,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:36:26,812 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 82 [2022-12-13 00:36:26,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 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 00:36:26,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:26,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 82 [2022-12-13 00:36:26,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:33,464 INFO L130 PetriNetUnfolder]: 66790/97256 cut-off events. [2022-12-13 00:36:33,465 INFO L131 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES. [2022-12-13 00:36:33,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185545 conditions, 97256 events. 66790/97256 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 4532. Compared 791823 event pairs, 9970 based on Foata normal form. 0/63205 useless extension candidates. Maximal degree in co-relation 185533. Up to 73765 conditions per place. [2022-12-13 00:36:33,780 INFO L137 encePairwiseOnDemand]: 78/82 looper letters, 48 selfloop transitions, 2 changer transitions 71/137 dead transitions. [2022-12-13 00:36:33,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 137 transitions, 535 flow [2022-12-13 00:36:33,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:36:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:36:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-12-13 00:36:33,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2022-12-13 00:36:33,791 INFO L175 Difference]: Start difference. First operand has 95 places, 82 transitions, 176 flow. Second operand 3 states and 174 transitions. [2022-12-13 00:36:33,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 137 transitions, 535 flow [2022-12-13 00:36:33,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 137 transitions, 528 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 00:36:33,796 INFO L231 Difference]: Finished difference. Result has 91 places, 44 transitions, 100 flow [2022-12-13 00:36:33,797 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=91, PETRI_TRANSITIONS=44} [2022-12-13 00:36:33,800 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places. [2022-12-13 00:36:33,800 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:33,801 INFO L89 Accepts]: Start accepts. Operand has 91 places, 44 transitions, 100 flow [2022-12-13 00:36:33,804 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:33,804 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:33,804 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 44 transitions, 100 flow [2022-12-13 00:36:33,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 44 transitions, 100 flow [2022-12-13 00:36:33,818 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-12-13 00:36:33,818 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:36:33,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 44 events. 0/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 117 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:36:33,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 44 transitions, 100 flow [2022-12-13 00:36:33,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 1158 [2022-12-13 00:36:33,976 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:36:33,978 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-13 00:36:33,978 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 100 flow [2022-12-13 00:36:33,979 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 00:36:33,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:33,979 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:36:33,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:36:33,982 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 00:36:33,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:33,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1983366052, now seen corresponding path program 1 times [2022-12-13 00:36:33,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:33,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504931570] [2022-12-13 00:36:33,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:33,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:34,159 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 00:36:34,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:34,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504931570] [2022-12-13 00:36:34,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504931570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:34,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:34,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:36:34,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256277852] [2022-12-13 00:36:34,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:34,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:36:34,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:34,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:36:34,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:36:34,162 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 00:36:34,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 100 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 00:36:34,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:34,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 00:36:34,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:36,567 INFO L130 PetriNetUnfolder]: 25015/34507 cut-off events. [2022-12-13 00:36:36,568 INFO L131 PetriNetUnfolder]: For 1337/1337 co-relation queries the response was YES. [2022-12-13 00:36:36,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69443 conditions, 34507 events. 25015/34507 cut-off events. For 1337/1337 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 194906 event pairs, 13343 based on Foata normal form. 0/27909 useless extension candidates. Maximal degree in co-relation 69433. Up to 32837 conditions per place. [2022-12-13 00:36:36,733 INFO L137 encePairwiseOnDemand]: 38/44 looper letters, 43 selfloop transitions, 5 changer transitions 2/61 dead transitions. [2022-12-13 00:36:36,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 242 flow [2022-12-13 00:36:36,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:36:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:36:36,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-13 00:36:36,737 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 00:36:36,737 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 100 flow. Second operand 3 states and 84 transitions. [2022-12-13 00:36:36,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 242 flow [2022-12-13 00:36:36,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:36:36,739 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 127 flow [2022-12-13 00:36:36,739 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2022-12-13 00:36:36,739 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -39 predicate places. [2022-12-13 00:36:36,740 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:36,740 INFO L89 Accepts]: Start accepts. Operand has 56 places, 47 transitions, 127 flow [2022-12-13 00:36:36,740 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:36,741 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:36,741 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 47 transitions, 127 flow [2022-12-13 00:36:36,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 127 flow [2022-12-13 00:36:36,754 INFO L130 PetriNetUnfolder]: 45/211 cut-off events. [2022-12-13 00:36:36,754 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:36:36,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 211 events. 45/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1137 event pairs, 23 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 294. Up to 76 conditions per place. [2022-12-13 00:36:36,757 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 127 flow [2022-12-13 00:36:36,757 INFO L226 LiptonReduction]: Number of co-enabled transitions 1182 [2022-12-13 00:36:36,809 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:36:36,810 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 00:36:36,811 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 127 flow [2022-12-13 00:36:36,811 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 00:36:36,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:36,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:36:36,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:36:36,812 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 00:36:36,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:36,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1552985298, now seen corresponding path program 1 times [2022-12-13 00:36:36,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:36,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385830409] [2022-12-13 00:36:36,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:36,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:36,961 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 00:36:36,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:36,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385830409] [2022-12-13 00:36:36,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385830409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:36,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:36,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:36:36,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245394975] [2022-12-13 00:36:36,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:36,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:36:36,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:36,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:36:36,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:36:36,963 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 00:36:36,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 00:36:36,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:36,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 00:36:36,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:38,464 INFO L130 PetriNetUnfolder]: 18491/25693 cut-off events. [2022-12-13 00:36:38,464 INFO L131 PetriNetUnfolder]: For 3811/3811 co-relation queries the response was YES. [2022-12-13 00:36:38,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55748 conditions, 25693 events. 18491/25693 cut-off events. For 3811/3811 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 139712 event pairs, 5203 based on Foata normal form. 416/22195 useless extension candidates. Maximal degree in co-relation 55737. Up to 18145 conditions per place. [2022-12-13 00:36:38,631 INFO L137 encePairwiseOnDemand]: 40/43 looper letters, 50 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2022-12-13 00:36:38,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 273 flow [2022-12-13 00:36:38,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:36:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:36:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-13 00:36:38,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2022-12-13 00:36:38,633 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 127 flow. Second operand 3 states and 83 transitions. [2022-12-13 00:36:38,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 273 flow [2022-12-13 00:36:38,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:36:38,634 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 133 flow [2022-12-13 00:36:38,634 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2022-12-13 00:36:38,647 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -38 predicate places. [2022-12-13 00:36:38,647 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:38,648 INFO L89 Accepts]: Start accepts. Operand has 57 places, 47 transitions, 133 flow [2022-12-13 00:36:38,648 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:38,648 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:38,648 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 47 transitions, 133 flow [2022-12-13 00:36:38,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 47 transitions, 133 flow [2022-12-13 00:36:38,656 INFO L130 PetriNetUnfolder]: 29/137 cut-off events. [2022-12-13 00:36:38,656 INFO L131 PetriNetUnfolder]: For 13/19 co-relation queries the response was YES. [2022-12-13 00:36:38,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 137 events. 29/137 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 659 event pairs, 11 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 217. Up to 53 conditions per place. [2022-12-13 00:36:38,658 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 47 transitions, 133 flow [2022-12-13 00:36:38,658 INFO L226 LiptonReduction]: Number of co-enabled transitions 1178 [2022-12-13 00:36:38,667 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:36:38,668 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 00:36:38,669 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 133 flow [2022-12-13 00:36:38,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 00:36:38,669 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:38,669 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:36:38,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:36:38,669 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 00:36:38,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:38,669 INFO L85 PathProgramCache]: Analyzing trace with hash 853429598, now seen corresponding path program 1 times [2022-12-13 00:36:38,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:38,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406009459] [2022-12-13 00:36:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:38,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:38,824 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 00:36:38,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:38,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406009459] [2022-12-13 00:36:38,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406009459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:38,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:38,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:36:38,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299011858] [2022-12-13 00:36:38,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:38,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:36:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:38,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:36:38,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:36:38,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 00:36:38,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 00:36:38,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:38,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 00:36:38,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:40,951 INFO L130 PetriNetUnfolder]: 24030/33278 cut-off events. [2022-12-13 00:36:40,951 INFO L131 PetriNetUnfolder]: For 4664/4859 co-relation queries the response was YES. [2022-12-13 00:36:41,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71354 conditions, 33278 events. 24030/33278 cut-off events. For 4664/4859 co-relation queries the response was YES. Maximal size of possible extension queue 1464. Compared 198205 event pairs, 7380 based on Foata normal form. 189/23082 useless extension candidates. Maximal degree in co-relation 71341. Up to 31819 conditions per place. [2022-12-13 00:36:41,190 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 46 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2022-12-13 00:36:41,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 311 flow [2022-12-13 00:36:41,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:36:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:36:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-12-13 00:36:41,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2022-12-13 00:36:41,192 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 133 flow. Second operand 3 states and 93 transitions. [2022-12-13 00:36:41,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 311 flow [2022-12-13 00:36:41,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:36:41,195 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 216 flow [2022-12-13 00:36:41,196 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2022-12-13 00:36:41,196 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -37 predicate places. [2022-12-13 00:36:41,196 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:41,196 INFO L89 Accepts]: Start accepts. Operand has 58 places, 59 transitions, 216 flow [2022-12-13 00:36:41,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:41,197 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:41,197 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 59 transitions, 216 flow [2022-12-13 00:36:41,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 59 transitions, 216 flow [2022-12-13 00:36:41,389 INFO L130 PetriNetUnfolder]: 2897/4654 cut-off events. [2022-12-13 00:36:41,389 INFO L131 PetriNetUnfolder]: For 204/225 co-relation queries the response was YES. [2022-12-13 00:36:41,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9266 conditions, 4654 events. 2897/4654 cut-off events. For 204/225 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 33557 event pairs, 1536 based on Foata normal form. 0/2088 useless extension candidates. Maximal degree in co-relation 9255. Up to 3925 conditions per place. [2022-12-13 00:36:41,429 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 59 transitions, 216 flow [2022-12-13 00:36:41,430 INFO L226 LiptonReduction]: Number of co-enabled transitions 1450 [2022-12-13 00:36:41,460 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:36:41,461 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 265 [2022-12-13 00:36:41,461 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 216 flow [2022-12-13 00:36:41,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 00:36:41,461 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:41,461 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:36:41,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:36:41,461 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 00:36:41,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:41,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1724113891, now seen corresponding path program 1 times [2022-12-13 00:36:41,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:41,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717827859] [2022-12-13 00:36:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:41,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:41,628 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 00:36:41,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:41,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717827859] [2022-12-13 00:36:41,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717827859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:41,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:41,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:36:41,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970580042] [2022-12-13 00:36:41,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:41,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:36:41,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:41,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:36:41,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:36:41,632 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 00:36:41,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 00:36:41,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:41,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 00:36:41,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:43,333 INFO L130 PetriNetUnfolder]: 15456/22676 cut-off events. [2022-12-13 00:36:43,333 INFO L131 PetriNetUnfolder]: For 3575/3647 co-relation queries the response was YES. [2022-12-13 00:36:43,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61042 conditions, 22676 events. 15456/22676 cut-off events. For 3575/3647 co-relation queries the response was YES. Maximal size of possible extension queue 1110. Compared 144347 event pairs, 2691 based on Foata normal form. 702/16457 useless extension candidates. Maximal degree in co-relation 61028. Up to 18595 conditions per place. [2022-12-13 00:36:43,465 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 59 selfloop transitions, 25 changer transitions 0/99 dead transitions. [2022-12-13 00:36:43,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 99 transitions, 498 flow [2022-12-13 00:36:43,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:36:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:36:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-12-13 00:36:43,466 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-12-13 00:36:43,467 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 216 flow. Second operand 4 states and 129 transitions. [2022-12-13 00:36:43,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 99 transitions, 498 flow [2022-12-13 00:36:43,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 99 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:36:43,470 INFO L231 Difference]: Finished difference. Result has 61 places, 71 transitions, 351 flow [2022-12-13 00:36:43,470 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=351, PETRI_PLACES=61, PETRI_TRANSITIONS=71} [2022-12-13 00:36:43,471 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -34 predicate places. [2022-12-13 00:36:43,471 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:43,471 INFO L89 Accepts]: Start accepts. Operand has 61 places, 71 transitions, 351 flow [2022-12-13 00:36:43,471 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:43,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:43,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 71 transitions, 351 flow [2022-12-13 00:36:43,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 71 transitions, 351 flow [2022-12-13 00:36:43,639 INFO L130 PetriNetUnfolder]: 2168/3778 cut-off events. [2022-12-13 00:36:43,639 INFO L131 PetriNetUnfolder]: For 384/804 co-relation queries the response was YES. [2022-12-13 00:36:43,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10900 conditions, 3778 events. 2168/3778 cut-off events. For 384/804 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 28266 event pairs, 627 based on Foata normal form. 12/1823 useless extension candidates. Maximal degree in co-relation 10887. Up to 3124 conditions per place. [2022-12-13 00:36:43,669 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 71 transitions, 351 flow [2022-12-13 00:36:43,669 INFO L226 LiptonReduction]: Number of co-enabled transitions 1834 [2022-12-13 00:36:43,688 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:36:43,689 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-13 00:36:43,689 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 71 transitions, 351 flow [2022-12-13 00:36:43,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 00:36:43,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:43,689 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] [2022-12-13 00:36:43,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:36:43,689 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 00:36:43,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash -540609070, now seen corresponding path program 1 times [2022-12-13 00:36:43,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:43,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075868518] [2022-12-13 00:36:43,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:43,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:43,964 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 00:36:43,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:43,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075868518] [2022-12-13 00:36:43,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075868518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:43,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:43,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:36:43,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684296358] [2022-12-13 00:36:43,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:43,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:36:43,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:43,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:36:43,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:36:43,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2022-12-13 00:36:43,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 71 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 00:36:43,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:43,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2022-12-13 00:36:43,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:47,207 INFO L130 PetriNetUnfolder]: 27437/42310 cut-off events. [2022-12-13 00:36:47,207 INFO L131 PetriNetUnfolder]: For 23349/29146 co-relation queries the response was YES. [2022-12-13 00:36:47,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135537 conditions, 42310 events. 27437/42310 cut-off events. For 23349/29146 co-relation queries the response was YES. Maximal size of possible extension queue 2328. Compared 327814 event pairs, 8100 based on Foata normal form. 1764/35853 useless extension candidates. Maximal degree in co-relation 135521. Up to 23473 conditions per place. [2022-12-13 00:36:47,494 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 155 selfloop transitions, 16 changer transitions 4/202 dead transitions. [2022-12-13 00:36:47,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 202 transitions, 1391 flow [2022-12-13 00:36:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:36:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:36:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2022-12-13 00:36:47,495 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2022-12-13 00:36:47,495 INFO L175 Difference]: Start difference. First operand has 61 places, 71 transitions, 351 flow. Second operand 6 states and 195 transitions. [2022-12-13 00:36:47,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 202 transitions, 1391 flow [2022-12-13 00:36:47,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 202 transitions, 1229 flow, removed 40 selfloop flow, removed 2 redundant places. [2022-12-13 00:36:47,508 INFO L231 Difference]: Finished difference. Result has 67 places, 90 transitions, 411 flow [2022-12-13 00:36:47,508 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=67, PETRI_TRANSITIONS=90} [2022-12-13 00:36:47,510 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -28 predicate places. [2022-12-13 00:36:47,510 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:47,510 INFO L89 Accepts]: Start accepts. Operand has 67 places, 90 transitions, 411 flow [2022-12-13 00:36:47,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:47,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:47,512 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 90 transitions, 411 flow [2022-12-13 00:36:47,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 90 transitions, 411 flow [2022-12-13 00:36:48,315 INFO L130 PetriNetUnfolder]: 9130/15890 cut-off events. [2022-12-13 00:36:48,315 INFO L131 PetriNetUnfolder]: For 5459/9221 co-relation queries the response was YES. [2022-12-13 00:36:48,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44457 conditions, 15890 events. 9130/15890 cut-off events. For 5459/9221 co-relation queries the response was YES. Maximal size of possible extension queue 2145. Compared 145740 event pairs, 2773 based on Foata normal form. 42/7886 useless extension candidates. Maximal degree in co-relation 44442. Up to 11926 conditions per place. [2022-12-13 00:36:48,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 90 transitions, 411 flow [2022-12-13 00:36:48,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 2876 [2022-12-13 00:36:48,814 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [404] L828-->L844: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_58 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse6 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_152 256) 0)) (.cse1 (and .cse4 .cse11)) (.cse2 (and .cse4 (= (mod v_~a$w_buff1_used~0_135 256) 0)))) (let ((.cse8 (or .cse12 .cse1 .cse2)) (.cse9 (and .cse6 (not .cse12)))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_53 v_~a$w_buff1~0_54))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= 0 (mod v_~a$w_buff0_used~0_151 256)))) (and (= v_~a$w_buff1_used~0_134 (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_60 (ite (and .cse6 (not .cse3)) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a$flush_delayed~0_17 0) (= v_~weak$$choice2~0_32 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_12 .cse7)) (= v_~a$w_buff1~0_54 v_~a$w_buff1~0_53) (= v_~weak$$choice0~0_11 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= .cse7 v_~__unbuffered_p3_EBX~0_12) (= v_~a~0_85 v_~a$mem_tmp~0_12) (= v_~a$w_buff0_used~0_151 (ite .cse0 v_~a$w_buff0_used~0_152 (ite .cse8 v_~a$w_buff0_used~0_152 (ite .cse9 0 v_~a$w_buff0_used~0_152)))) (= (ite .cse0 v_~a$r_buff1_thd4~0_58 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse10 .cse11) (and .cse10 .cse5) .cse3)) v_~a$r_buff1_thd4~0_58 0)) v_~a$r_buff1_thd4~0_57)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_54, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_58, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_152, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_57, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_151, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_53, ~a$flush_delayed~0=v_~a$flush_delayed~0_17, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4] and [468] L2-1-->L886: Formula: (let ((.cse4 (not (= (mod v_~a$r_buff1_thd0~0_32 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_213 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_34 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_184 256) 0)) .cse4)) (.cse1 (and .cse5 (not (= 0 (mod v_~a$w_buff0_used~0_214 256)))))) (and (= v_~a$r_buff0_thd0~0_33 (ite .cse0 0 v_~a$r_buff0_thd0~0_34)) (= v_~a~0_120 (ite .cse1 v_~a$w_buff0~0_94 (ite .cse2 v_~a$w_buff1~0_82 v_~a~0_121))) (= v_~a$w_buff1_used~0_183 (ite (or .cse0 .cse2) 0 v_~a$w_buff1_used~0_184)) (= (ite .cse1 0 v_~a$w_buff0_used~0_214) v_~a$w_buff0_used~0_213) (= v_~a$r_buff1_thd0~0_31 (ite (or (and .cse3 (not (= (mod v_~a$r_buff0_thd0~0_33 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_183 256) 0)) .cse4)) 0 v_~a$r_buff1_thd0~0_32))))) InVars {~a~0=v_~a~0_121, ~a$w_buff1~0=v_~a$w_buff1~0_82, ~a$w_buff0~0=v_~a$w_buff0~0_94, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_32, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_214, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_184} OutVars{~a~0=v_~a~0_120, ~a$w_buff1~0=v_~a$w_buff1~0_82, ~a$w_buff0~0=v_~a$w_buff0~0_94, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_31, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_213, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_33, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_183} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ~a$r_buff0_thd0~0, ~a$w_buff1_used~0] [2022-12-13 00:36:49,162 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [404] L828-->L844: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_58 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse6 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_152 256) 0)) (.cse1 (and .cse4 .cse11)) (.cse2 (and .cse4 (= (mod v_~a$w_buff1_used~0_135 256) 0)))) (let ((.cse8 (or .cse12 .cse1 .cse2)) (.cse9 (and .cse6 (not .cse12)))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_53 v_~a$w_buff1~0_54))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= 0 (mod v_~a$w_buff0_used~0_151 256)))) (and (= v_~a$w_buff1_used~0_134 (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_60 (ite (and .cse6 (not .cse3)) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a$flush_delayed~0_17 0) (= v_~weak$$choice2~0_32 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_12 .cse7)) (= v_~a$w_buff1~0_54 v_~a$w_buff1~0_53) (= v_~weak$$choice0~0_11 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= .cse7 v_~__unbuffered_p3_EBX~0_12) (= v_~a~0_85 v_~a$mem_tmp~0_12) (= v_~a$w_buff0_used~0_151 (ite .cse0 v_~a$w_buff0_used~0_152 (ite .cse8 v_~a$w_buff0_used~0_152 (ite .cse9 0 v_~a$w_buff0_used~0_152)))) (= (ite .cse0 v_~a$r_buff1_thd4~0_58 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse10 .cse11) (and .cse10 .cse5) .cse3)) v_~a$r_buff1_thd4~0_58 0)) v_~a$r_buff1_thd4~0_57)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_54, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_58, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_152, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_57, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_151, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_53, ~a$flush_delayed~0=v_~a$flush_delayed~0_17, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4] and [390] L788-->L795: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_155 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_156 256) 0)))) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_139 256) 0)) .cse3)) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_88 (ite .cse0 v_~a$w_buff0~0_56 (ite .cse1 v_~a$w_buff1~0_57 v_~a~0_89))) (= v_~a$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_23 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_138 256) 0)))) 0 v_~a$r_buff1_thd2~0_20)) (= (ite .cse0 0 v_~a$w_buff0_used~0_156) v_~a$w_buff0_used~0_155) (= (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_139) v_~a$w_buff1_used~0_138) (= v_~a$r_buff0_thd2~0_23 (ite .cse4 0 v_~a$r_buff0_thd2~0_24))))) InVars {~a~0=v_~a~0_89, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_20, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_156, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_139} OutVars{~a~0=v_~a~0_88, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_19, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_23, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_155, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_138} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0] [2022-12-13 00:36:49,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [404] L828-->L844: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_58 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse6 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_152 256) 0)) (.cse1 (and .cse4 .cse11)) (.cse2 (and .cse4 (= (mod v_~a$w_buff1_used~0_135 256) 0)))) (let ((.cse8 (or .cse12 .cse1 .cse2)) (.cse9 (and .cse6 (not .cse12)))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_53 v_~a$w_buff1~0_54))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= 0 (mod v_~a$w_buff0_used~0_151 256)))) (and (= v_~a$w_buff1_used~0_134 (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_60 (ite (and .cse6 (not .cse3)) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a$flush_delayed~0_17 0) (= v_~weak$$choice2~0_32 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_12 .cse7)) (= v_~a$w_buff1~0_54 v_~a$w_buff1~0_53) (= v_~weak$$choice0~0_11 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= .cse7 v_~__unbuffered_p3_EBX~0_12) (= v_~a~0_85 v_~a$mem_tmp~0_12) (= v_~a$w_buff0_used~0_151 (ite .cse0 v_~a$w_buff0_used~0_152 (ite .cse8 v_~a$w_buff0_used~0_152 (ite .cse9 0 v_~a$w_buff0_used~0_152)))) (= (ite .cse0 v_~a$r_buff1_thd4~0_58 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse10 .cse11) (and .cse10 .cse5) .cse3)) v_~a$r_buff1_thd4~0_58 0)) v_~a$r_buff1_thd4~0_57)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_54, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_58, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_152, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_57, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_151, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_53, ~a$flush_delayed~0=v_~a$flush_delayed~0_17, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4] and [397] L808-->L815: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_111 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_111) v_~a$w_buff1_used~0_110) (= v_~a~0_58 (ite .cse4 v_~a$w_buff0~0_38 (ite .cse3 v_~a$w_buff1~0_35 v_~a~0_59))) (= (ite .cse4 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_25 (ite .cse2 0 v_~a$r_buff0_thd3~0_26))))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0] [2022-12-13 00:36:49,966 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:36:49,966 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2456 [2022-12-13 00:36:49,966 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 89 transitions, 419 flow [2022-12-13 00:36:49,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 00:36:49,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:49,967 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 00:36:49,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:36:49,967 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 00:36:49,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:49,967 INFO L85 PathProgramCache]: Analyzing trace with hash -949249314, now seen corresponding path program 1 times [2022-12-13 00:36:49,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:49,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030240505] [2022-12-13 00:36:49,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:49,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:50,156 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 00:36:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:50,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030240505] [2022-12-13 00:36:50,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030240505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:50,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:50,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:36:50,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549218208] [2022-12-13 00:36:50,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:50,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:36:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:50,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:36:50,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:36:50,158 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2022-12-13 00:36:50,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 89 transitions, 419 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 00:36:50,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:50,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2022-12-13 00:36:50,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:52,094 INFO L130 PetriNetUnfolder]: 17114/26471 cut-off events. [2022-12-13 00:36:52,094 INFO L131 PetriNetUnfolder]: For 19026/19099 co-relation queries the response was YES. [2022-12-13 00:36:52,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89586 conditions, 26471 events. 17114/26471 cut-off events. For 19026/19099 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 187602 event pairs, 1244 based on Foata normal form. 1924/19301 useless extension candidates. Maximal degree in co-relation 89568. Up to 12826 conditions per place. [2022-12-13 00:36:52,265 INFO L137 encePairwiseOnDemand]: 34/48 looper letters, 113 selfloop transitions, 37 changer transitions 12/176 dead transitions. [2022-12-13 00:36:52,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 176 transitions, 1128 flow [2022-12-13 00:36:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:36:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:36:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2022-12-13 00:36:52,267 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2022-12-13 00:36:52,267 INFO L175 Difference]: Start difference. First operand has 66 places, 89 transitions, 419 flow. Second operand 5 states and 175 transitions. [2022-12-13 00:36:52,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 176 transitions, 1128 flow [2022-12-13 00:36:52,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 176 transitions, 1104 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-13 00:36:52,307 INFO L231 Difference]: Finished difference. Result has 70 places, 98 transitions, 587 flow [2022-12-13 00:36:52,307 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=587, PETRI_PLACES=70, PETRI_TRANSITIONS=98} [2022-12-13 00:36:52,307 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -25 predicate places. [2022-12-13 00:36:52,307 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:52,307 INFO L89 Accepts]: Start accepts. Operand has 70 places, 98 transitions, 587 flow [2022-12-13 00:36:52,308 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:52,308 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:52,308 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 98 transitions, 587 flow [2022-12-13 00:36:52,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 98 transitions, 587 flow [2022-12-13 00:36:52,931 INFO L130 PetriNetUnfolder]: 5717/10197 cut-off events. [2022-12-13 00:36:52,931 INFO L131 PetriNetUnfolder]: For 4202/9869 co-relation queries the response was YES. [2022-12-13 00:36:52,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37954 conditions, 10197 events. 5717/10197 cut-off events. For 4202/9869 co-relation queries the response was YES. Maximal size of possible extension queue 1275. Compared 87605 event pairs, 535 based on Foata normal form. 60/5067 useless extension candidates. Maximal degree in co-relation 37937. Up to 7660 conditions per place. [2022-12-13 00:36:53,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 98 transitions, 587 flow [2022-12-13 00:36:53,009 INFO L226 LiptonReduction]: Number of co-enabled transitions 2636 [2022-12-13 00:36:53,252 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:36:53,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 946 [2022-12-13 00:36:53,253 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 98 transitions, 593 flow [2022-12-13 00:36:53,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 00:36:53,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:53,254 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 00:36:53,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:36:53,254 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 00:36:53,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1703597494, now seen corresponding path program 1 times [2022-12-13 00:36:53,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:53,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886330052] [2022-12-13 00:36:53,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:53,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:53,844 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 00:36:53,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:53,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886330052] [2022-12-13 00:36:53,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886330052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:53,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:53,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:36:53,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554529588] [2022-12-13 00:36:53,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:53,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:36:53,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:53,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:36:53,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:36:53,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2022-12-13 00:36:53,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 98 transitions, 593 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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 00:36:53,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:53,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2022-12-13 00:36:53,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:56,206 INFO L130 PetriNetUnfolder]: 17108/27898 cut-off events. [2022-12-13 00:36:56,207 INFO L131 PetriNetUnfolder]: For 35421/40239 co-relation queries the response was YES. [2022-12-13 00:36:56,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113446 conditions, 27898 events. 17108/27898 cut-off events. For 35421/40239 co-relation queries the response was YES. Maximal size of possible extension queue 1495. Compared 220292 event pairs, 2129 based on Foata normal form. 1940/23950 useless extension candidates. Maximal degree in co-relation 113426. Up to 17857 conditions per place. [2022-12-13 00:36:56,395 INFO L137 encePairwiseOnDemand]: 36/47 looper letters, 176 selfloop transitions, 19 changer transitions 12/237 dead transitions. [2022-12-13 00:36:56,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 237 transitions, 1842 flow [2022-12-13 00:36:56,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:36:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:36:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 216 transitions. [2022-12-13 00:36:56,396 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6565349544072948 [2022-12-13 00:36:56,397 INFO L175 Difference]: Start difference. First operand has 70 places, 98 transitions, 593 flow. Second operand 7 states and 216 transitions. [2022-12-13 00:36:56,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 237 transitions, 1842 flow [2022-12-13 00:36:57,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 237 transitions, 1572 flow, removed 64 selfloop flow, removed 3 redundant places. [2022-12-13 00:36:57,198 INFO L231 Difference]: Finished difference. Result has 78 places, 115 transitions, 665 flow [2022-12-13 00:36:57,198 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=665, PETRI_PLACES=78, PETRI_TRANSITIONS=115} [2022-12-13 00:36:57,198 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -17 predicate places. [2022-12-13 00:36:57,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:57,198 INFO L89 Accepts]: Start accepts. Operand has 78 places, 115 transitions, 665 flow [2022-12-13 00:36:57,200 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:57,200 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:57,200 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 115 transitions, 665 flow [2022-12-13 00:36:57,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 115 transitions, 665 flow [2022-12-13 00:36:57,823 INFO L130 PetriNetUnfolder]: 5962/11179 cut-off events. [2022-12-13 00:36:57,823 INFO L131 PetriNetUnfolder]: For 8805/9715 co-relation queries the response was YES. [2022-12-13 00:36:57,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34989 conditions, 11179 events. 5962/11179 cut-off events. For 8805/9715 co-relation queries the response was YES. Maximal size of possible extension queue 1494. Compared 102278 event pairs, 541 based on Foata normal form. 94/5481 useless extension candidates. Maximal degree in co-relation 34967. Up to 7048 conditions per place. [2022-12-13 00:36:57,902 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 115 transitions, 665 flow [2022-12-13 00:36:57,902 INFO L226 LiptonReduction]: Number of co-enabled transitions 3140 [2022-12-13 00:36:58,331 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:36:58,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1134 [2022-12-13 00:36:58,332 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 115 transitions, 677 flow [2022-12-13 00:36:58,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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 00:36:58,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:58,333 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 00:36:58,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:36:58,333 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 00:36:58,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:58,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1594407006, now seen corresponding path program 1 times [2022-12-13 00:36:58,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:58,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913207546] [2022-12-13 00:36:58,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:58,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:58,477 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 00:36:58,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:58,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913207546] [2022-12-13 00:36:58,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913207546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:58,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:58,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:36:58,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922487731] [2022-12-13 00:36:58,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:58,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:36:58,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:58,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:36:58,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:36:58,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2022-12-13 00:36:58,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 115 transitions, 677 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 00:36:58,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:58,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2022-12-13 00:36:58,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:02,513 INFO L130 PetriNetUnfolder]: 33664/52196 cut-off events. [2022-12-13 00:37:02,513 INFO L131 PetriNetUnfolder]: For 83050/90583 co-relation queries the response was YES. [2022-12-13 00:37:02,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192898 conditions, 52196 events. 33664/52196 cut-off events. For 83050/90583 co-relation queries the response was YES. Maximal size of possible extension queue 2839. Compared 413308 event pairs, 3556 based on Foata normal form. 4346/46107 useless extension candidates. Maximal degree in co-relation 192873. Up to 23245 conditions per place. [2022-12-13 00:37:02,849 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 186 selfloop transitions, 11 changer transitions 31/251 dead transitions. [2022-12-13 00:37:02,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 251 transitions, 1944 flow [2022-12-13 00:37:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:37:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:37:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2022-12-13 00:37:02,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.564625850340136 [2022-12-13 00:37:02,851 INFO L175 Difference]: Start difference. First operand has 78 places, 115 transitions, 677 flow. Second operand 6 states and 166 transitions. [2022-12-13 00:37:02,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 251 transitions, 1944 flow [2022-12-13 00:37:04,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 251 transitions, 1928 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-13 00:37:04,493 INFO L231 Difference]: Finished difference. Result has 85 places, 115 transitions, 683 flow [2022-12-13 00:37:04,493 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=683, PETRI_PLACES=85, PETRI_TRANSITIONS=115} [2022-12-13 00:37:04,494 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -10 predicate places. [2022-12-13 00:37:04,494 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:04,494 INFO L89 Accepts]: Start accepts. Operand has 85 places, 115 transitions, 683 flow [2022-12-13 00:37:04,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:04,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:04,495 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 115 transitions, 683 flow [2022-12-13 00:37:04,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 115 transitions, 683 flow [2022-12-13 00:37:05,596 INFO L130 PetriNetUnfolder]: 11911/21098 cut-off events. [2022-12-13 00:37:05,597 INFO L131 PetriNetUnfolder]: For 17776/21800 co-relation queries the response was YES. [2022-12-13 00:37:05,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66775 conditions, 21098 events. 11911/21098 cut-off events. For 17776/21800 co-relation queries the response was YES. Maximal size of possible extension queue 3069. Compared 201995 event pairs, 848 based on Foata normal form. 178/9866 useless extension candidates. Maximal degree in co-relation 66749. Up to 14095 conditions per place. [2022-12-13 00:37:05,844 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 115 transitions, 683 flow [2022-12-13 00:37:05,844 INFO L226 LiptonReduction]: Number of co-enabled transitions 3110 [2022-12-13 00:37:06,004 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [443] $Ultimate##0-->L825: Formula: (and (= |v_P3Thread1of1ForFork1_#in~arg.offset_5| v_P3Thread1of1ForFork1_~arg.offset_5) (= v_~z~0_12 1) (= v_P3Thread1of1ForFork1_~arg.base_5 |v_P3Thread1of1ForFork1_#in~arg.base_5|)) InVars {P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|} OutVars{P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, ~z~0=v_~z~0_12, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_5, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~z~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] and [389] L785-->L788: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-13 00:37:06,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [443] $Ultimate##0-->L825: Formula: (and (= |v_P3Thread1of1ForFork1_#in~arg.offset_5| v_P3Thread1of1ForFork1_~arg.offset_5) (= v_~z~0_12 1) (= v_P3Thread1of1ForFork1_~arg.base_5 |v_P3Thread1of1ForFork1_#in~arg.base_5|)) InVars {P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|} OutVars{P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, ~z~0=v_~z~0_12, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_5, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~z~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] and [396] L805-->L808: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 00:37:06,039 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [443] $Ultimate##0-->L825: Formula: (and (= |v_P3Thread1of1ForFork1_#in~arg.offset_5| v_P3Thread1of1ForFork1_~arg.offset_5) (= v_~z~0_12 1) (= v_P3Thread1of1ForFork1_~arg.base_5 |v_P3Thread1of1ForFork1_#in~arg.base_5|)) InVars {P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|} OutVars{P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, ~z~0=v_~z~0_12, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_5, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~z~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] and [566] $Ultimate##0-->L768: Formula: (and (= v_~a$r_buff0_thd0~0_132 v_~a$r_buff1_thd0~0_142) (= |v_P0Thread1of1ForFork0_~arg#1.base_73| |v_P0Thread1of1ForFork0_#in~arg#1.base_73|) (= v_~a$w_buff0~0_295 v_~a$w_buff1~0_244) (= v_~a$w_buff0~0_294 1) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_73| |v_P0Thread1of1ForFork0_~arg#1.offset_73|) (= v_~a$w_buff0_used~0_517 v_~a$w_buff1_used~0_442) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_77| (ite (not (and (not (= (mod v_~a$w_buff0_used~0_516 256) 0)) (not (= (mod v_~a$w_buff1_used~0_442 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_77| 0)) (= v_~a$r_buff0_thd1~0_195 v_~a$r_buff1_thd1~0_137) (= v_~x~0_39 v_~__unbuffered_p0_EAX~0_139) (= v_~a$w_buff0_used~0_516 1) (= v_~a$r_buff0_thd4~0_207 v_~a$r_buff1_thd4~0_210) (= v_~a$r_buff0_thd1~0_194 1) (= v_~a$r_buff0_thd3~0_117 v_~a$r_buff1_thd3~0_129) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_77| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_77|) (= v_~a$r_buff0_thd2~0_151 v_~a$r_buff1_thd2~0_166)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_73|, ~a$w_buff0~0=v_~a$w_buff0~0_295, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_151, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_117, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_517, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_73|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_195, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_132, ~x~0=v_~x~0_39, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_207} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_73|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_210, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_137, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_129, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_166, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_151, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_73|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_117, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_516, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_73|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_194, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_132, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_73|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_207, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ~a$w_buff1~0=v_~a$w_buff1~0_244, ~a$w_buff0~0=v_~a$w_buff0~0_294, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_77|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_142, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_442, ~x~0=v_~x~0_39, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_77|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork0_~arg#1.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] [2022-12-13 00:37:06,186 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] $Ultimate##0-->L788: Formula: (and (= v_~z~0_50 1) (= v_P3Thread1of1ForFork1_~arg.offset_13 |v_P3Thread1of1ForFork1_#in~arg.offset_13|) (= v_P3Thread1of1ForFork1_~arg.base_13 |v_P3Thread1of1ForFork1_#in~arg.base_13|) (= v_~y~0_76 v_~__unbuffered_p1_EAX~0_159)) InVars {P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_13|, ~y~0=v_~y~0_76, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_13|} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_159, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_13|, ~z~0=v_~z~0_50, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_13, ~y~0=v_~y~0_76, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_13|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, ~z~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] and [403] L825-->L828: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-13 00:37:06,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [577] $Ultimate##0-->L768: Formula: (and (= v_P3Thread1of1ForFork1_~arg.offset_17 |v_P3Thread1of1ForFork1_#in~arg.offset_17|) (= v_~x~0_48 v_~__unbuffered_p0_EAX~0_146) (= v_~z~0_54 1) (= v_~a$r_buff0_thd1~0_209 v_~a$r_buff1_thd1~0_144) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_84| 0)) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_80| |v_P0Thread1of1ForFork0_~arg#1.offset_80|) (= v_~a$r_buff0_thd1~0_208 1) (= v_~a$r_buff0_thd2~0_163 v_~a$r_buff1_thd2~0_177) (= v_~a$w_buff0_used~0_567 v_~a$w_buff1_used~0_485) (= (ite (not (and (not (= (mod v_~a$w_buff1_used~0_485 256) 0)) (not (= (mod v_~a$w_buff0_used~0_566 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_84|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_84| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_84|) (= v_~a$r_buff0_thd3~0_128 v_~a$r_buff1_thd3~0_140) (= v_~a$r_buff0_thd4~0_233 v_~a$r_buff1_thd4~0_235) (= v_~a$w_buff0~0_331 v_~a$w_buff1~0_273) (= v_~a$w_buff0_used~0_566 1) (= v_P3Thread1of1ForFork1_~arg.base_17 |v_P3Thread1of1ForFork1_#in~arg.base_17|) (= v_~a$w_buff0~0_330 1) (= v_~a$r_buff0_thd0~0_155 v_~a$r_buff1_thd0~0_165) (= |v_P0Thread1of1ForFork0_~arg#1.base_80| |v_P0Thread1of1ForFork0_#in~arg#1.base_80|)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_80|, ~a$w_buff0~0=v_~a$w_buff0~0_331, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_17|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_163, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_128, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_567, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_80|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_209, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_155, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_233, ~x~0=v_~x~0_48, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_235, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_177, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_163, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_80|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_155, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_80|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_233, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ~a$w_buff1~0=v_~a$w_buff1~0_273, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_84|, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_84|, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_80|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_144, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_140, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_80|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_128, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_566, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_208, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_17|, ~a$w_buff0~0=v_~a$w_buff0~0_330, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_165, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_485, ~z~0=v_~z~0_54, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd3~0, P0Thread1of1ForFork0_~arg#1.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.offset, P3Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, P3Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, ~z~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] and [403] L825-->L828: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-13 00:37:06,512 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:37:06,513 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2019 [2022-12-13 00:37:06,513 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 114 transitions, 687 flow [2022-12-13 00:37:06,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 00:37:06,513 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:06,513 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] [2022-12-13 00:37:06,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:37:06,514 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 00:37:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2047653915, now seen corresponding path program 1 times [2022-12-13 00:37:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:06,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104675130] [2022-12-13 00:37:06,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:06,788 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 00:37:06,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:06,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104675130] [2022-12-13 00:37:06,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104675130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:06,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:06,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:37:06,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119999513] [2022-12-13 00:37:06,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:06,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:37:06,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:06,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:37:06,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:37:06,790 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2022-12-13 00:37:06,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 114 transitions, 687 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 00:37:06,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:06,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2022-12-13 00:37:06,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:11,770 INFO L130 PetriNetUnfolder]: 39218/62346 cut-off events. [2022-12-13 00:37:11,771 INFO L131 PetriNetUnfolder]: For 107087/115586 co-relation queries the response was YES. [2022-12-13 00:37:12,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235017 conditions, 62346 events. 39218/62346 cut-off events. For 107087/115586 co-relation queries the response was YES. Maximal size of possible extension queue 3751. Compared 534721 event pairs, 5316 based on Foata normal form. 4813/53427 useless extension candidates. Maximal degree in co-relation 234988. Up to 27872 conditions per place. [2022-12-13 00:37:12,129 INFO L137 encePairwiseOnDemand]: 47/52 looper letters, 180 selfloop transitions, 2 changer transitions 22/233 dead transitions. [2022-12-13 00:37:12,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 233 transitions, 1823 flow [2022-12-13 00:37:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:37:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:37:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-12-13 00:37:12,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6971153846153846 [2022-12-13 00:37:12,130 INFO L175 Difference]: Start difference. First operand has 84 places, 114 transitions, 687 flow. Second operand 4 states and 145 transitions. [2022-12-13 00:37:12,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 233 transitions, 1823 flow [2022-12-13 00:37:15,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 233 transitions, 1791 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 00:37:15,367 INFO L231 Difference]: Finished difference. Result has 85 places, 114 transitions, 678 flow [2022-12-13 00:37:15,367 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=678, PETRI_PLACES=85, PETRI_TRANSITIONS=114} [2022-12-13 00:37:15,367 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -10 predicate places. [2022-12-13 00:37:15,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:15,367 INFO L89 Accepts]: Start accepts. Operand has 85 places, 114 transitions, 678 flow [2022-12-13 00:37:15,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:15,368 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:15,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 114 transitions, 678 flow [2022-12-13 00:37:15,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 114 transitions, 678 flow [2022-12-13 00:37:17,217 INFO L130 PetriNetUnfolder]: 18046/31697 cut-off events. [2022-12-13 00:37:17,218 INFO L131 PetriNetUnfolder]: For 23797/29867 co-relation queries the response was YES. [2022-12-13 00:37:17,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100525 conditions, 31697 events. 18046/31697 cut-off events. For 23797/29867 co-relation queries the response was YES. Maximal size of possible extension queue 4269. Compared 313361 event pairs, 1276 based on Foata normal form. 252/14605 useless extension candidates. Maximal degree in co-relation 100500. Up to 21736 conditions per place. [2022-12-13 00:37:17,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 114 transitions, 678 flow [2022-12-13 00:37:17,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 3134 [2022-12-13 00:37:18,054 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:37:18,054 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2687 [2022-12-13 00:37:18,054 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 114 transitions, 681 flow [2022-12-13 00:37:18,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 00:37:18,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:18,055 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] [2022-12-13 00:37:18,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:37:18,055 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:18,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:18,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1698550528, now seen corresponding path program 1 times [2022-12-13 00:37:18,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:18,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469572738] [2022-12-13 00:37:18,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:18,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:18,239 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 00:37:18,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:18,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469572738] [2022-12-13 00:37:18,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469572738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:18,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:18,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:37:18,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945176965] [2022-12-13 00:37:18,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:18,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:37:18,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:18,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:37:18,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:37:18,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2022-12-13 00:37:18,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 114 transitions, 681 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 00:37:18,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:18,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2022-12-13 00:37:18,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:21,943 INFO L130 PetriNetUnfolder]: 31712/47991 cut-off events. [2022-12-13 00:37:21,943 INFO L131 PetriNetUnfolder]: For 62313/62730 co-relation queries the response was YES. [2022-12-13 00:37:22,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179005 conditions, 47991 events. 31712/47991 cut-off events. For 62313/62730 co-relation queries the response was YES. Maximal size of possible extension queue 2386. Compared 364163 event pairs, 662 based on Foata normal form. 3911/31455 useless extension candidates. Maximal degree in co-relation 178977. Up to 17262 conditions per place. [2022-12-13 00:37:22,219 INFO L137 encePairwiseOnDemand]: 36/52 looper letters, 96 selfloop transitions, 49 changer transitions 38/195 dead transitions. [2022-12-13 00:37:22,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 195 transitions, 1457 flow [2022-12-13 00:37:22,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:37:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:37:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2022-12-13 00:37:22,220 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2022-12-13 00:37:22,221 INFO L175 Difference]: Start difference. First operand has 85 places, 114 transitions, 681 flow. Second operand 6 states and 188 transitions. [2022-12-13 00:37:22,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 195 transitions, 1457 flow [2022-12-13 00:37:29,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 195 transitions, 1444 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:29,395 INFO L231 Difference]: Finished difference. Result has 89 places, 98 transitions, 673 flow [2022-12-13 00:37:29,396 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=673, PETRI_PLACES=89, PETRI_TRANSITIONS=98} [2022-12-13 00:37:29,396 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -6 predicate places. [2022-12-13 00:37:29,396 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:29,396 INFO L89 Accepts]: Start accepts. Operand has 89 places, 98 transitions, 673 flow [2022-12-13 00:37:29,397 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:29,397 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:29,397 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 98 transitions, 673 flow [2022-12-13 00:37:29,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 98 transitions, 673 flow [2022-12-13 00:37:29,545 INFO L130 PetriNetUnfolder]: 1657/3159 cut-off events. [2022-12-13 00:37:29,545 INFO L131 PetriNetUnfolder]: For 2029/3758 co-relation queries the response was YES. [2022-12-13 00:37:29,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11756 conditions, 3159 events. 1657/3159 cut-off events. For 2029/3758 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 22821 event pairs, 15 based on Foata normal form. 5/1172 useless extension candidates. Maximal degree in co-relation 11730. Up to 1621 conditions per place. [2022-12-13 00:37:29,576 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 98 transitions, 673 flow [2022-12-13 00:37:29,577 INFO L226 LiptonReduction]: Number of co-enabled transitions 2196 [2022-12-13 00:37:29,971 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:37:29,972 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 576 [2022-12-13 00:37:29,972 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 94 transitions, 665 flow [2022-12-13 00:37:29,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 00:37:29,972 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:29,972 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 00:37:29,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:37:29,972 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:29,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:29,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1357264764, now seen corresponding path program 1 times [2022-12-13 00:37:29,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:29,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881824839] [2022-12-13 00:37:29,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:29,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:30,144 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 00:37:30,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:30,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881824839] [2022-12-13 00:37:30,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881824839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:30,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:30,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:30,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884904195] [2022-12-13 00:37:30,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:30,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:37:30,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:30,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:37:30,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:37:30,147 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2022-12-13 00:37:30,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 94 transitions, 665 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 00:37:30,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:30,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2022-12-13 00:37:30,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:31,192 INFO L130 PetriNetUnfolder]: 8396/12749 cut-off events. [2022-12-13 00:37:31,192 INFO L131 PetriNetUnfolder]: For 29768/31083 co-relation queries the response was YES. [2022-12-13 00:37:31,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55112 conditions, 12749 events. 8396/12749 cut-off events. For 29768/31083 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 83061 event pairs, 670 based on Foata normal form. 540/10283 useless extension candidates. Maximal degree in co-relation 55083. Up to 5756 conditions per place. [2022-12-13 00:37:31,259 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 77 selfloop transitions, 3 changer transitions 93/195 dead transitions. [2022-12-13 00:37:31,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 195 transitions, 1709 flow [2022-12-13 00:37:31,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:37:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:37:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2022-12-13 00:37:31,261 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5875 [2022-12-13 00:37:31,261 INFO L175 Difference]: Start difference. First operand has 80 places, 94 transitions, 665 flow. Second operand 6 states and 141 transitions. [2022-12-13 00:37:31,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 195 transitions, 1709 flow [2022-12-13 00:37:31,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 195 transitions, 1429 flow, removed 64 selfloop flow, removed 6 redundant places. [2022-12-13 00:37:31,965 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 450 flow [2022-12-13 00:37:31,965 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=450, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2022-12-13 00:37:31,965 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -14 predicate places. [2022-12-13 00:37:31,965 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:31,965 INFO L89 Accepts]: Start accepts. Operand has 81 places, 81 transitions, 450 flow [2022-12-13 00:37:31,966 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:31,966 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:31,966 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 81 transitions, 450 flow [2022-12-13 00:37:31,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 81 transitions, 450 flow [2022-12-13 00:37:32,045 INFO L130 PetriNetUnfolder]: 1010/1814 cut-off events. [2022-12-13 00:37:32,045 INFO L131 PetriNetUnfolder]: For 5035/7470 co-relation queries the response was YES. [2022-12-13 00:37:32,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5552 conditions, 1814 events. 1010/1814 cut-off events. For 5035/7470 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 11274 event pairs, 3 based on Foata normal form. 16/599 useless extension candidates. Maximal degree in co-relation 5526. Up to 811 conditions per place. [2022-12-13 00:37:32,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 81 transitions, 450 flow [2022-12-13 00:37:32,058 INFO L226 LiptonReduction]: Number of co-enabled transitions 1326 [2022-12-13 00:37:32,240 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:37:32,241 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 276 [2022-12-13 00:37:32,241 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 456 flow [2022-12-13 00:37:32,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 00:37:32,241 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:32,242 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] [2022-12-13 00:37:32,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:37:32,242 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:32,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:32,242 INFO L85 PathProgramCache]: Analyzing trace with hash 476808438, now seen corresponding path program 1 times [2022-12-13 00:37:32,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:32,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783496580] [2022-12-13 00:37:32,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:32,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:32,887 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 00:37:32,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:32,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783496580] [2022-12-13 00:37:32,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783496580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:32,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:32,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:37:32,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551258629] [2022-12-13 00:37:32,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:32,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:37:32,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:32,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:37:32,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:37:32,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2022-12-13 00:37:32,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 456 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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 00:37:32,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:32,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2022-12-13 00:37:32,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:33,542 INFO L130 PetriNetUnfolder]: 4723/7354 cut-off events. [2022-12-13 00:37:33,542 INFO L131 PetriNetUnfolder]: For 14517/14993 co-relation queries the response was YES. [2022-12-13 00:37:33,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27650 conditions, 7354 events. 4723/7354 cut-off events. For 14517/14993 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 44674 event pairs, 854 based on Foata normal form. 324/5736 useless extension candidates. Maximal degree in co-relation 27621. Up to 3529 conditions per place. [2022-12-13 00:37:33,585 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 59 selfloop transitions, 2 changer transitions 67/150 dead transitions. [2022-12-13 00:37:33,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 150 transitions, 1087 flow [2022-12-13 00:37:33,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:37:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:37:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-13 00:37:33,586 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6054054054054054 [2022-12-13 00:37:33,586 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 456 flow. Second operand 5 states and 112 transitions. [2022-12-13 00:37:33,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 150 transitions, 1087 flow [2022-12-13 00:37:33,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 150 transitions, 1068 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-13 00:37:33,935 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 425 flow [2022-12-13 00:37:33,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=425, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2022-12-13 00:37:33,936 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -18 predicate places. [2022-12-13 00:37:33,936 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:33,936 INFO L89 Accepts]: Start accepts. Operand has 77 places, 77 transitions, 425 flow [2022-12-13 00:37:33,937 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:33,937 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:33,937 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 77 transitions, 425 flow [2022-12-13 00:37:33,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 77 transitions, 425 flow [2022-12-13 00:37:34,028 INFO L130 PetriNetUnfolder]: 1237/2106 cut-off events. [2022-12-13 00:37:34,028 INFO L131 PetriNetUnfolder]: For 2769/2943 co-relation queries the response was YES. [2022-12-13 00:37:34,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6431 conditions, 2106 events. 1237/2106 cut-off events. For 2769/2943 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 12762 event pairs, 7 based on Foata normal form. 14/721 useless extension candidates. Maximal degree in co-relation 6406. Up to 1000 conditions per place. [2022-12-13 00:37:34,046 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 77 transitions, 425 flow [2022-12-13 00:37:34,046 INFO L226 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-13 00:37:34,048 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:34,048 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 00:37:34,048 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 425 flow [2022-12-13 00:37:34,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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 00:37:34,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:34,049 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] [2022-12-13 00:37:34,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:37:34,049 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:34,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:34,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1392807611, now seen corresponding path program 1 times [2022-12-13 00:37:34,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:34,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021804343] [2022-12-13 00:37:34,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:34,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:34,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:34,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021804343] [2022-12-13 00:37:34,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021804343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:34,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:34,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:37:34,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791485340] [2022-12-13 00:37:34,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:34,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:37:34,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:34,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:37:34,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:37:34,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2022-12-13 00:37:34,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 425 flow. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 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 00:37:34,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:34,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2022-12-13 00:37:34,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:35,270 INFO L130 PetriNetUnfolder]: 4384/6789 cut-off events. [2022-12-13 00:37:35,270 INFO L131 PetriNetUnfolder]: For 13185/13564 co-relation queries the response was YES. [2022-12-13 00:37:35,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25181 conditions, 6789 events. 4384/6789 cut-off events. For 13185/13564 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 41584 event pairs, 378 based on Foata normal form. 273/5208 useless extension candidates. Maximal degree in co-relation 25153. Up to 2678 conditions per place. [2022-12-13 00:37:35,305 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 86 selfloop transitions, 9 changer transitions 63/179 dead transitions. [2022-12-13 00:37:35,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 179 transitions, 1317 flow [2022-12-13 00:37:35,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:37:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:37:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2022-12-13 00:37:35,307 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5793650793650794 [2022-12-13 00:37:35,307 INFO L175 Difference]: Start difference. First operand has 74 places, 77 transitions, 425 flow. Second operand 7 states and 146 transitions. [2022-12-13 00:37:35,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 179 transitions, 1317 flow [2022-12-13 00:37:35,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 179 transitions, 1305 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 00:37:35,606 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 495 flow [2022-12-13 00:37:35,606 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=495, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2022-12-13 00:37:35,607 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -15 predicate places. [2022-12-13 00:37:35,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:35,607 INFO L89 Accepts]: Start accepts. Operand has 80 places, 82 transitions, 495 flow [2022-12-13 00:37:35,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:35,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:35,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 82 transitions, 495 flow [2022-12-13 00:37:35,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 82 transitions, 495 flow [2022-12-13 00:37:35,740 INFO L130 PetriNetUnfolder]: 1798/3032 cut-off events. [2022-12-13 00:37:35,740 INFO L131 PetriNetUnfolder]: For 5417/6842 co-relation queries the response was YES. [2022-12-13 00:37:35,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8956 conditions, 3032 events. 1798/3032 cut-off events. For 5417/6842 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 20259 event pairs, 6 based on Foata normal form. 17/972 useless extension candidates. Maximal degree in co-relation 8929. Up to 1459 conditions per place. [2022-12-13 00:37:35,766 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 82 transitions, 495 flow [2022-12-13 00:37:35,766 INFO L226 LiptonReduction]: Number of co-enabled transitions 1268 [2022-12-13 00:37:36,152 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] $Ultimate##0-->L844: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_242 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_240 256) 0))) (let ((.cse9 (not .cse8)) (.cse4 (and .cse8 (= (mod v_~a$w_buff1_used~0_502 256) 0))) (.cse5 (and .cse11 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_589 256) 0))) (let ((.cse2 (or .cse4 .cse5 .cse12)) (.cse3 (and .cse9 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_392 (ite .cse3 v_~a$w_buff0~0_347 v_~a$w_buff1~0_284))) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse7 (= (mod v_~a$w_buff1_used~0_501 256) 0)) (.cse6 (= (mod v_~a$w_buff0_used~0_588 256) 0))) (and (= v_~weak$$choice2~0_66 |v_P3Thread1of1ForFork1_#t~nondet4_54|) (= v_~a~0_391 (ite .cse0 v_~a$mem_tmp~0_50 .cse1)) (= (ite .cse0 v_~a$w_buff0_used~0_589 (ite .cse2 v_~a$w_buff0_used~0_589 (ite .cse3 0 v_~a$w_buff0_used~0_589))) v_~a$w_buff0_used~0_588) (= v_~a$flush_delayed~0_53 0) (= .cse1 v_~__unbuffered_p3_EBX~0_160) (= v_~weak$$choice0~0_53 |v_P3Thread1of1ForFork1_#t~nondet3_54|) (= v_~a$w_buff0~0_347 v_~a$w_buff0~0_346) (= v_~z~0_64 1) (= (ite .cse0 v_~a$w_buff1_used~0_502 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_502 0)) v_~a$w_buff1_used~0_501) (= v_P3Thread1of1ForFork1_~arg.base_25 |v_P3Thread1of1ForFork1_#in~arg.base_25|) (= (ite .cse0 v_~a$r_buff0_thd4~0_240 (ite (or .cse5 .cse6 (and .cse7 .cse8)) v_~a$r_buff0_thd4~0_240 (ite (and .cse9 (not .cse6)) 0 v_~a$r_buff0_thd4~0_240))) v_~a$r_buff0_thd4~0_239) (= v_~z~0_64 v_~__unbuffered_p3_EAX~0_140) (= v_~a$r_buff1_thd4~0_241 (ite .cse0 v_~a$r_buff1_thd4~0_242 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_239 256) 0))) (or (and .cse10 .cse11) (and .cse7 .cse10) .cse6)) v_~a$r_buff1_thd4~0_242 0))) (= v_P3Thread1of1ForFork1_~arg.offset_25 |v_P3Thread1of1ForFork1_#in~arg.offset_25|) (= v_~a~0_392 v_~a$mem_tmp~0_50) (= v_~a$w_buff1~0_284 v_~a$w_buff1~0_283)))))) InVars {~a~0=v_~a~0_392, ~a$w_buff1~0=v_~a$w_buff1~0_284, ~a$w_buff0~0=v_~a$w_buff0~0_347, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_242, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_25|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_589, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_502, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_240, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_25|, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_54|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_54|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_241, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_588, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_160, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_239, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_25|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_25, ~a~0=v_~a~0_391, ~a$mem_tmp~0=v_~a$mem_tmp~0_50, ~weak$$choice0~0=v_~weak$$choice0~0_53, ~a$w_buff1~0=v_~a$w_buff1~0_283, ~a$flush_delayed~0=v_~a$flush_delayed~0_53, ~a$w_buff0~0=v_~a$w_buff0~0_346, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_25|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~z~0=v_~z~0_64, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_25, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork1_~arg.base, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~z~0, P3Thread1of1ForFork1_~arg.offset, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4] and [390] L788-->L795: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_155 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_156 256) 0)))) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_139 256) 0)) .cse3)) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_88 (ite .cse0 v_~a$w_buff0~0_56 (ite .cse1 v_~a$w_buff1~0_57 v_~a~0_89))) (= v_~a$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_23 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_138 256) 0)))) 0 v_~a$r_buff1_thd2~0_20)) (= (ite .cse0 0 v_~a$w_buff0_used~0_156) v_~a$w_buff0_used~0_155) (= (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_139) v_~a$w_buff1_used~0_138) (= v_~a$r_buff0_thd2~0_23 (ite .cse4 0 v_~a$r_buff0_thd2~0_24))))) InVars {~a~0=v_~a~0_89, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_20, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_156, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_139} OutVars{~a~0=v_~a~0_88, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_19, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_23, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_155, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_138} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0] [2022-12-13 00:37:36,729 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:37:36,730 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1123 [2022-12-13 00:37:36,730 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 510 flow [2022-12-13 00:37:36,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 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 00:37:36,730 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:36,730 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] [2022-12-13 00:37:36,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 00:37:36,730 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:36,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:36,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1718749345, now seen corresponding path program 2 times [2022-12-13 00:37:36,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:36,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385079835] [2022-12-13 00:37:36,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:36,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:37:36,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:37:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:37:36,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:37:36,899 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:37:36,900 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 00:37:36,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 00:37:36,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 00:37:36,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 00:37:36,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 00:37:36,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 00:37:36,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 00:37:36,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 00:37:36,902 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:36,906 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:37:36,906 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:37:36,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:37:36 BasicIcfg [2022-12-13 00:37:36,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:37:36,987 INFO L158 Benchmark]: Toolchain (without parser) took 76882.65ms. Allocated memory was 224.4MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 198.8MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2022-12-13 00:37:36,987 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 224.4MB. Free memory was 202.4MB in the beginning and 202.3MB in the end (delta: 71.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:37:36,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.53ms. Allocated memory is still 224.4MB. Free memory was 198.8MB in the beginning and 170.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 00:37:36,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.25ms. Allocated memory is still 224.4MB. Free memory was 170.5MB in the beginning and 168.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:37:36,987 INFO L158 Benchmark]: Boogie Preprocessor took 53.73ms. Allocated memory is still 224.4MB. Free memory was 168.3MB in the beginning and 166.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:37:36,987 INFO L158 Benchmark]: RCFGBuilder took 649.69ms. Allocated memory was 224.4MB in the beginning and 269.5MB in the end (delta: 45.1MB). Free memory was 166.3MB in the beginning and 234.7MB in the end (delta: -68.5MB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. [2022-12-13 00:37:36,988 INFO L158 Benchmark]: TraceAbstraction took 75669.19ms. Allocated memory was 269.5MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 233.7MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2022-12-13 00:37:36,989 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 224.4MB. Free memory was 202.4MB in the beginning and 202.3MB in the end (delta: 71.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 469.53ms. Allocated memory is still 224.4MB. Free memory was 198.8MB in the beginning and 170.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.25ms. Allocated memory is still 224.4MB. Free memory was 170.5MB in the beginning and 168.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.73ms. Allocated memory is still 224.4MB. Free memory was 168.3MB in the beginning and 166.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 649.69ms. Allocated memory was 224.4MB in the beginning and 269.5MB in the end (delta: 45.1MB). Free memory was 166.3MB in the beginning and 234.7MB in the end (delta: -68.5MB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. * TraceAbstraction took 75669.19ms. Allocated memory was 269.5MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 233.7MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 139 PlacesBefore, 95 PlacesAfterwards, 128 TransitionsBefore, 82 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 2 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4763, independent: 4548, independent conditional: 4548, independent unconditional: 0, dependent: 215, dependent conditional: 215, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4763, independent: 4548, independent conditional: 0, independent unconditional: 4548, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4763, independent: 4548, independent conditional: 0, independent unconditional: 4548, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4763, independent: 4548, independent conditional: 0, independent unconditional: 4548, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2727, independent: 2656, independent conditional: 0, independent unconditional: 2656, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2727, independent: 2641, independent conditional: 0, independent unconditional: 2641, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 86, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 259, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 243, dependent conditional: 0, dependent unconditional: 243, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4763, independent: 1892, independent conditional: 0, independent unconditional: 1892, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 2727, unknown conditional: 0, unknown unconditional: 2727] , Statistics on independence cache: Total cache size (in pairs): 5089, Positive cache size: 5018, Positive conditional cache size: 0, Positive unconditional cache size: 5018, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, 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.2s, 55 PlacesBefore, 55 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 418, independent: 370, independent conditional: 370, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 418, independent: 370, independent conditional: 19, independent unconditional: 351, dependent: 48, dependent conditional: 16, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 418, independent: 370, independent conditional: 19, independent unconditional: 351, dependent: 48, dependent conditional: 16, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 418, independent: 370, independent conditional: 19, independent unconditional: 351, dependent: 48, dependent conditional: 16, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 375, independent: 339, independent conditional: 18, independent unconditional: 321, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 375, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 117, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 85, dependent conditional: 33, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 418, independent: 31, independent conditional: 1, independent unconditional: 30, dependent: 12, dependent conditional: 8, dependent unconditional: 4, unknown: 375, unknown conditional: 26, unknown unconditional: 349] , Statistics on independence cache: Total cache size (in pairs): 375, Positive cache size: 339, Positive conditional cache size: 18, Positive unconditional cache size: 321, Negative cache size: 36, Negative conditional cache size: 8, 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.1s, 55 PlacesBefore, 55 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 407, independent: 368, independent conditional: 368, 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: 407, independent: 368, independent conditional: 10, independent unconditional: 358, dependent: 39, dependent conditional: 6, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 407, independent: 368, independent conditional: 0, independent unconditional: 368, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 407, independent: 368, independent conditional: 0, independent unconditional: 368, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 44, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 407, independent: 334, independent conditional: 0, independent unconditional: 334, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 44, unknown conditional: 0, unknown unconditional: 44] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 373, Positive conditional cache size: 18, Positive unconditional cache size: 355, Negative cache size: 46, Negative conditional cache size: 8, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 1178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 389, independent: 349, independent conditional: 349, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 389, independent: 349, independent conditional: 10, independent unconditional: 339, dependent: 40, dependent conditional: 6, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 389, independent: 349, independent conditional: 0, independent unconditional: 349, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 389, independent: 349, independent conditional: 0, independent unconditional: 349, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 389, independent: 348, independent conditional: 0, independent unconditional: 348, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 421, Positive cache size: 374, Positive conditional cache size: 18, Positive unconditional cache size: 356, Negative cache size: 47, Negative conditional cache size: 8, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 168, independent conditional: 168, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 206, independent: 168, independent conditional: 20, independent unconditional: 148, dependent: 38, dependent conditional: 6, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 206, independent: 168, independent conditional: 12, independent unconditional: 156, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 206, independent: 168, independent conditional: 12, independent unconditional: 156, dependent: 38, dependent conditional: 0, dependent unconditional: 38, 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: 206, independent: 168, independent conditional: 12, independent unconditional: 156, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 421, Positive cache size: 374, Positive conditional cache size: 18, Positive unconditional cache size: 356, Negative cache size: 47, Negative conditional cache size: 8, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1834 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 279, independent: 229, independent conditional: 229, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 279, independent: 229, independent conditional: 38, independent unconditional: 191, dependent: 50, dependent conditional: 6, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 279, independent: 229, independent conditional: 30, independent unconditional: 199, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 279, independent: 229, independent conditional: 30, independent unconditional: 199, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 2, independent unconditional: 5, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 279, independent: 222, independent conditional: 28, independent unconditional: 194, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 428, Positive cache size: 381, Positive conditional cache size: 20, Positive unconditional cache size: 361, Negative cache size: 47, Negative conditional cache size: 8, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 67 PlacesBefore, 66 PlacesAfterwards, 90 TransitionsBefore, 89 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 332, independent: 320, independent conditional: 320, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 332, independent: 320, independent conditional: 215, independent unconditional: 105, dependent: 12, dependent conditional: 10, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 332, independent: 320, independent conditional: 206, independent unconditional: 114, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 332, independent: 320, independent conditional: 206, independent unconditional: 114, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 17, independent unconditional: 15, 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: 32, independent: 32, independent conditional: 0, independent unconditional: 32, 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: 332, independent: 288, independent conditional: 189, independent unconditional: 99, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 32, unknown conditional: 17, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 433, Positive conditional cache size: 37, Positive unconditional cache size: 396, Negative cache size: 47, Negative conditional cache size: 8, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 70 PlacesBefore, 70 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 2636 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 156, independent: 144, independent conditional: 67, independent unconditional: 77, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 156, independent: 144, independent conditional: 53, independent unconditional: 91, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 156, independent: 144, independent conditional: 53, independent unconditional: 91, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 1, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 156, independent: 134, independent conditional: 52, independent unconditional: 82, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 11, unknown conditional: 1, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 492, Positive cache size: 444, Positive conditional cache size: 38, Positive unconditional cache size: 406, Negative cache size: 48, Negative conditional cache size: 8, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 78 PlacesBefore, 78 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 3140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 212, independent: 200, independent conditional: 200, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 212, independent: 200, independent conditional: 106, independent unconditional: 94, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 216, independent: 200, independent conditional: 98, independent unconditional: 102, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 216, independent: 200, independent conditional: 98, independent unconditional: 102, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 216, independent: 200, independent conditional: 98, independent unconditional: 102, dependent: 15, dependent conditional: 3, dependent unconditional: 12, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 495, Positive cache size: 446, Positive conditional cache size: 38, Positive unconditional cache size: 408, Negative cache size: 49, Negative conditional cache size: 9, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 85 PlacesBefore, 84 PlacesAfterwards, 115 TransitionsBefore, 114 TransitionsAfterwards, 3110 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 287, independent: 266, independent conditional: 266, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 287, independent: 266, independent conditional: 197, independent unconditional: 69, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 317, independent: 266, independent conditional: 153, independent unconditional: 113, dependent: 51, dependent conditional: 9, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 317, independent: 266, independent conditional: 153, independent unconditional: 113, dependent: 51, dependent conditional: 9, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 35, independent unconditional: 11, 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: 46, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 317, independent: 220, independent conditional: 118, independent unconditional: 102, dependent: 51, dependent conditional: 9, dependent unconditional: 42, unknown: 46, unknown conditional: 35, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 570, Positive cache size: 521, Positive conditional cache size: 73, Positive unconditional cache size: 448, Negative cache size: 49, Negative conditional cache size: 9, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 86, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 85 PlacesBefore, 85 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 3134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 142, independent conditional: 142, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 150, independent: 142, independent conditional: 96, independent unconditional: 46, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 142, independent conditional: 93, independent unconditional: 49, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 142, independent conditional: 93, independent unconditional: 49, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 6, independent unconditional: 16, 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: 150, independent: 120, independent conditional: 87, independent unconditional: 33, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 22, unknown conditional: 6, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 607, Positive cache size: 558, Positive conditional cache size: 80, Positive unconditional cache size: 478, Negative cache size: 49, Negative conditional cache size: 9, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 84 PlacesBefore, 80 PlacesAfterwards, 98 TransitionsBefore, 94 TransitionsAfterwards, 2196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 294, independent: 290, independent conditional: 290, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 294, independent: 290, independent conditional: 217, independent unconditional: 73, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 294, independent: 290, independent conditional: 216, independent unconditional: 74, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 294, independent: 290, independent conditional: 216, independent unconditional: 74, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 7, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 294, independent: 275, independent conditional: 209, independent unconditional: 66, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 16, unknown conditional: 7, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 648, Positive cache size: 598, Positive conditional cache size: 88, Positive unconditional cache size: 510, Negative cache size: 50, Negative conditional cache size: 9, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 77 PlacesBefore, 76 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 1326 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, 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: 57, independent: 57, independent conditional: 47, independent unconditional: 10, 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: 57, independent: 57, independent conditional: 47, independent unconditional: 10, 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: 57, independent: 57, independent conditional: 47, independent unconditional: 10, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 57, independent: 49, independent conditional: 39, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 681, Positive cache size: 631, Positive conditional cache size: 97, Positive unconditional cache size: 534, Negative cache size: 50, Negative conditional cache size: 9, Negative unconditional cache size: 41, 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, 74 PlacesBefore, 74 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 681, Positive cache size: 631, Positive conditional cache size: 97, Positive unconditional cache size: 534, Negative cache size: 50, Negative conditional cache size: 9, Negative unconditional cache size: 41, 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: 1.0s, 79 PlacesBefore, 78 PlacesAfterwards, 82 TransitionsBefore, 81 TransitionsAfterwards, 1268 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 162, independent conditional: 162, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 164, independent: 162, independent conditional: 146, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 162, independent conditional: 146, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 162, independent conditional: 146, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 72, independent: 72, independent conditional: 64, 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: 72, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, independent: 90, independent conditional: 82, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 72, unknown conditional: 64, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 764, Positive cache size: 714, Positive conditional cache size: 161, Positive unconditional cache size: 553, Negative cache size: 50, Negative conditional cache size: 9, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, 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 __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L868] 0 pthread_t t433; [L869] FCALL, FORK 0 pthread_create(&t433, ((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, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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(&t433, ((void *)0), P0, ((void *)0))=-3, t433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t434; [L871] FCALL, FORK 0 pthread_create(&t434, ((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, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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(&t434, ((void *)0), P1, ((void *)0))=-2, t433={5:0}, t434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t435; [L873] FCALL, FORK 0 pthread_create(&t435, ((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, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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(&t435, ((void *)0), P2, ((void *)0))=-1, t433={5:0}, t434={6:0}, t435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] 0 pthread_t t436; [L875] FCALL, FORK 0 pthread_create(&t436, ((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, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t436, ((void *)0), P3, ((void *)0))=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 [L767] 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, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 [L787] 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, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=0, z=0] [L790] 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) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 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 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 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, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=0, z=0] [L797] 2 __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, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=0, z=0] [L804] 3 y = 1 [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L824] 4 z = 1 [L827] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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] [L810] 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) [L811] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 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 [L813] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 a$flush_delayed = weak$$choice2 [L833] 4 a$mem_tmp = a [L834] 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) [L835] 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)) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 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)) [L841] 4 __unbuffered_p3_EBX = a [L842] 4 a = a$flush_delayed ? a$mem_tmp : a [L843] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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] [L846] 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) [L847] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 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 [L849] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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] [L770] 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) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 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 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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] [L817] 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=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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] [L853] 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=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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] [L877] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L879] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L879] RET 0 assume_abort_if_not(main$tmp_guard0) [L881] 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) [L882] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 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 [L884] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 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 [L888] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 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=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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: 871]: 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: 875]: 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: 873]: 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: 869]: 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, 169 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: 75.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 54.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 740 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 740 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2198 IncrementalHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 18 mSDtfsCounter, 2198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=687occurred in iteration=9, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 1792 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:37:37,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...