/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/mix021.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:56:04,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:56:04,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:56:04,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:56:04,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:56:04,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:56:04,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:56:04,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:56:04,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:56:04,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:56:04,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:56:04,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:56:04,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:56:04,447 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:56:04,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:56:04,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:56:04,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:56:04,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:56:04,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:56:04,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:56:04,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:56:04,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:56:04,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:56:04,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:56:04,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:56:04,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:56:04,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:56:04,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:56:04,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:56:04,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:56:04,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:56:04,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:56:04,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:56:04,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:56:04,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:56:04,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:56:04,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:56:04,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:56:04,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:56:04,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:56:04,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:56:04,470 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-05 22:56:04,493 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:56:04,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:56:04,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:56:04,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:56:04,495 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:56:04,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:56:04,496 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:56:04,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:56:04,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:56:04,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:56:04,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:56:04,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:56:04,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:56:04,497 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:56:04,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:56:04,497 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:56:04,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:56:04,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:56:04,497 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:56:04,498 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:56:04,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:56:04,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:56:04,498 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:56:04,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:56:04,498 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:56:04,498 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:56:04,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:56:04,498 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:56:04,498 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-05 22:56:04,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:56:04,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:56:04,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:56:04,762 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:56:04,762 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:56:04,763 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021.opt.i [2022-12-05 22:56:05,808 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:56:06,048 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:56:06,048 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021.opt.i [2022-12-05 22:56:06,066 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60631dd2d/65cc29a88d8f46e28dfd315d6945202b/FLAGdb7d105e6 [2022-12-05 22:56:06,080 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60631dd2d/65cc29a88d8f46e28dfd315d6945202b [2022-12-05 22:56:06,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:56:06,082 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:56:06,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:56:06,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:56:06,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:56:06,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:56:06" (1/1) ... [2022-12-05 22:56:06,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28e858d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:06, skipping insertion in model container [2022-12-05 22:56:06,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:56:06" (1/1) ... [2022-12-05 22:56:06,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:56:06,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:56:06,270 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/mix021.opt.i[944,957] [2022-12-05 22:56:06,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:56:06,454 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:56:06,464 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/mix021.opt.i[944,957] [2022-12-05 22:56:06,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:06,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:06,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:56:06,547 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:56:06,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:06 WrapperNode [2022-12-05 22:56:06,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:56:06,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:56:06,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:56:06,549 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:56:06,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:06" (1/1) ... [2022-12-05 22:56:06,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:06" (1/1) ... [2022-12-05 22:56:06,596 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2022-12-05 22:56:06,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:56:06,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:56:06,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:56:06,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:56:06,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:06" (1/1) ... [2022-12-05 22:56:06,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:06" (1/1) ... [2022-12-05 22:56:06,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:06" (1/1) ... [2022-12-05 22:56:06,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:06" (1/1) ... [2022-12-05 22:56:06,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:06" (1/1) ... [2022-12-05 22:56:06,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:06" (1/1) ... [2022-12-05 22:56:06,615 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:06" (1/1) ... [2022-12-05 22:56:06,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:06" (1/1) ... [2022-12-05 22:56:06,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:56:06,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:56:06,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:56:06,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:56:06,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:06" (1/1) ... [2022-12-05 22:56:06,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:56:06,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:56:06,656 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-05 22:56:06,679 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-05 22:56:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:56:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:56:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:56:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:56:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:56:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 22:56:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 22:56:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 22:56:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 22:56:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 22:56:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 22:56:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 22:56:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 22:56:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:56:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:56:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:56:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:56:06,695 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:56:06,785 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:56:06,786 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:56:07,041 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:56:07,156 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:56:07,156 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 22:56:07,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:56:07 BoogieIcfgContainer [2022-12-05 22:56:07,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:56:07,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:56:07,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:56:07,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:56:07,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:56:06" (1/3) ... [2022-12-05 22:56:07,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7faad76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:56:07, skipping insertion in model container [2022-12-05 22:56:07,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:06" (2/3) ... [2022-12-05 22:56:07,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7faad76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:56:07, skipping insertion in model container [2022-12-05 22:56:07,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:56:07" (3/3) ... [2022-12-05 22:56:07,163 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021.opt.i [2022-12-05 22:56:07,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:56:07,176 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:56:07,177 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:56:07,294 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:56:07,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 274 flow [2022-12-05 22:56:07,360 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-05 22:56:07,360 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:56:07,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-05 22:56:07,364 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 127 transitions, 274 flow [2022-12-05 22:56:07,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 123 transitions, 258 flow [2022-12-05 22:56:07,368 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:07,378 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 123 transitions, 258 flow [2022-12-05 22:56:07,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 123 transitions, 258 flow [2022-12-05 22:56:07,426 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-05 22:56:07,426 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:56:07,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-05 22:56:07,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 123 transitions, 258 flow [2022-12-05 22:56:07,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 2718 [2022-12-05 22:56:11,259 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-05 22:56:11,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:56:11,278 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=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;@69b836ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:56:11,278 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 22:56:11,284 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-05 22:56:11,284 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:56:11,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:11,285 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:11,285 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:11,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:11,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1006641483, now seen corresponding path program 1 times [2022-12-05 22:56:11,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:11,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018026636] [2022-12-05 22:56:11,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:11,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:11,611 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-05 22:56:11,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:11,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018026636] [2022-12-05 22:56:11,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018026636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:11,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:11,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:56:11,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114730664] [2022-12-05 22:56:11,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:11,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:56:11,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:11,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:56:11,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:56:11,632 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-05 22:56:11,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-05 22:56:11,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:11,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-05 22:56:11,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:12,096 INFO L130 PetriNetUnfolder]: 3113/4513 cut-off events. [2022-12-05 22:56:12,096 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-05 22:56:12,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8907 conditions, 4513 events. 3113/4513 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 23908 event pairs, 593 based on Foata normal form. 0/4149 useless extension candidates. Maximal degree in co-relation 8895. Up to 3385 conditions per place. [2022-12-05 22:56:12,116 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 30 selfloop transitions, 2 changer transitions 4/39 dead transitions. [2022-12-05 22:56:12,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 162 flow [2022-12-05 22:56:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:56:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:56:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-05 22:56:12,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 22:56:12,126 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 50 transitions. [2022-12-05 22:56:12,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 162 flow [2022-12-05 22:56:12,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 22:56:12,131 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 62 flow [2022-12-05 22:56:12,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-05 22:56:12,135 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2022-12-05 22:56:12,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:12,136 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 62 flow [2022-12-05 22:56:12,137 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:12,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:12,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 62 flow [2022-12-05 22:56:12,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 62 flow [2022-12-05 22:56:12,148 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-05 22:56:12,148 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:56:12,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 22:56:12,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 62 flow [2022-12-05 22:56:12,149 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-05 22:56:12,244 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:12,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-05 22:56:12,246 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 62 flow [2022-12-05 22:56:12,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-05 22:56:12,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:12,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:12,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:56:12,250 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:12,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1014865772, now seen corresponding path program 1 times [2022-12-05 22:56:12,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:12,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726303759] [2022-12-05 22:56:12,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:12,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:12,455 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-05 22:56:12,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:12,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726303759] [2022-12-05 22:56:12,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726303759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:12,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:12,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:56:12,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504904141] [2022-12-05 22:56:12,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:12,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:56:12,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:12,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:56:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:56:12,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 22:56:12,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 62 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-05 22:56:12,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:12,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 22:56:12,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:13,170 INFO L130 PetriNetUnfolder]: 7369/10218 cut-off events. [2022-12-05 22:56:13,171 INFO L131 PetriNetUnfolder]: For 354/354 co-relation queries the response was YES. [2022-12-05 22:56:13,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21094 conditions, 10218 events. 7369/10218 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 51248 event pairs, 2585 based on Foata normal form. 292/10510 useless extension candidates. Maximal degree in co-relation 21084. Up to 6285 conditions per place. [2022-12-05 22:56:13,212 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 37 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2022-12-05 22:56:13,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 198 flow [2022-12-05 22:56:13,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:56:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:56:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-05 22:56:13,213 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2022-12-05 22:56:13,213 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 62 flow. Second operand 3 states and 46 transitions. [2022-12-05 22:56:13,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 198 flow [2022-12-05 22:56:13,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:56:13,220 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 120 flow [2022-12-05 22:56:13,220 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2022-12-05 22:56:13,221 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2022-12-05 22:56:13,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:13,221 INFO L89 Accepts]: Start accepts. Operand has 38 places, 32 transitions, 120 flow [2022-12-05 22:56:13,222 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:13,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:13,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 32 transitions, 120 flow [2022-12-05 22:56:13,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 120 flow [2022-12-05 22:56:13,263 INFO L130 PetriNetUnfolder]: 276/608 cut-off events. [2022-12-05 22:56:13,264 INFO L131 PetriNetUnfolder]: For 86/114 co-relation queries the response was YES. [2022-12-05 22:56:13,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 608 events. 276/608 cut-off events. For 86/114 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3661 event pairs, 120 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 1259. Up to 325 conditions per place. [2022-12-05 22:56:13,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 32 transitions, 120 flow [2022-12-05 22:56:13,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-05 22:56:13,286 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:13,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-05 22:56:13,287 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 120 flow [2022-12-05 22:56:13,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-05 22:56:13,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:13,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:13,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:56:13,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:13,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1396067723, now seen corresponding path program 1 times [2022-12-05 22:56:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:13,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336379915] [2022-12-05 22:56:13,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:13,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:13,377 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-05 22:56:13,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:13,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336379915] [2022-12-05 22:56:13,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336379915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:13,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:13,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:56:13,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684861730] [2022-12-05 22:56:13,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:13,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:56:13,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:13,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:56:13,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:56:13,379 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 22:56:13,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 120 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05 22:56:13,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:13,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 22:56:13,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:13,994 INFO L130 PetriNetUnfolder]: 6845/9498 cut-off events. [2022-12-05 22:56:13,995 INFO L131 PetriNetUnfolder]: For 4744/4744 co-relation queries the response was YES. [2022-12-05 22:56:14,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25156 conditions, 9498 events. 6845/9498 cut-off events. For 4744/4744 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 45618 event pairs, 1751 based on Foata normal form. 104/9602 useless extension candidates. Maximal degree in co-relation 25144. Up to 4339 conditions per place. [2022-12-05 22:56:14,035 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 47 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2022-12-05 22:56:14,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 56 transitions, 310 flow [2022-12-05 22:56:14,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:56:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:56:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-05 22:56:14,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.51 [2022-12-05 22:56:14,037 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 120 flow. Second operand 4 states and 51 transitions. [2022-12-05 22:56:14,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 56 transitions, 310 flow [2022-12-05 22:56:14,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:56:14,047 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 172 flow [2022-12-05 22:56:14,047 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-05 22:56:14,047 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-05 22:56:14,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:14,047 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 172 flow [2022-12-05 22:56:14,048 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:14,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:14,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 172 flow [2022-12-05 22:56:14,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 172 flow [2022-12-05 22:56:14,074 INFO L130 PetriNetUnfolder]: 222/488 cut-off events. [2022-12-05 22:56:14,075 INFO L131 PetriNetUnfolder]: For 324/386 co-relation queries the response was YES. [2022-12-05 22:56:14,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 488 events. 222/488 cut-off events. For 324/386 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2659 event pairs, 69 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 1232. Up to 265 conditions per place. [2022-12-05 22:56:14,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 172 flow [2022-12-05 22:56:14,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 422 [2022-12-05 22:56:14,081 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:14,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-05 22:56:14,082 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 172 flow [2022-12-05 22:56:14,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05 22:56:14,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:14,083 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:14,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:56:14,083 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:14,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash 329719636, now seen corresponding path program 1 times [2022-12-05 22:56:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:14,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979554145] [2022-12-05 22:56:14,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:14,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:14,182 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-05 22:56:14,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:14,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979554145] [2022-12-05 22:56:14,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979554145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:14,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:14,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:56:14,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331163351] [2022-12-05 22:56:14,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:14,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:56:14,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:14,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:56:14,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:56:14,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 22:56:14,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 172 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-05 22:56:14,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:14,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 22:56:14,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:14,801 INFO L130 PetriNetUnfolder]: 6661/9250 cut-off events. [2022-12-05 22:56:14,802 INFO L131 PetriNetUnfolder]: For 7245/7245 co-relation queries the response was YES. [2022-12-05 22:56:14,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26245 conditions, 9250 events. 6661/9250 cut-off events. For 7245/7245 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 45750 event pairs, 851 based on Foata normal form. 32/9282 useless extension candidates. Maximal degree in co-relation 26230. Up to 5233 conditions per place. [2022-12-05 22:56:14,839 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 56 selfloop transitions, 19 changer transitions 0/75 dead transitions. [2022-12-05 22:56:14,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 75 transitions, 472 flow [2022-12-05 22:56:14,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:56:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:56:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-05 22:56:14,841 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-05 22:56:14,841 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 172 flow. Second operand 4 states and 61 transitions. [2022-12-05 22:56:14,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 75 transitions, 472 flow [2022-12-05 22:56:14,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 75 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:56:14,854 INFO L231 Difference]: Finished difference. Result has 47 places, 49 transitions, 342 flow [2022-12-05 22:56:14,854 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=342, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2022-12-05 22:56:14,855 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2022-12-05 22:56:14,855 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:14,855 INFO L89 Accepts]: Start accepts. Operand has 47 places, 49 transitions, 342 flow [2022-12-05 22:56:14,855 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:14,855 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:14,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 49 transitions, 342 flow [2022-12-05 22:56:14,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 342 flow [2022-12-05 22:56:14,881 INFO L130 PetriNetUnfolder]: 189/435 cut-off events. [2022-12-05 22:56:14,881 INFO L131 PetriNetUnfolder]: For 870/1023 co-relation queries the response was YES. [2022-12-05 22:56:14,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1456 conditions, 435 events. 189/435 cut-off events. For 870/1023 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2362 event pairs, 55 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 1440. Up to 230 conditions per place. [2022-12-05 22:56:14,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 49 transitions, 342 flow [2022-12-05 22:56:14,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-05 22:56:14,895 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:14,896 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-05 22:56:14,896 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 342 flow [2022-12-05 22:56:14,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-05 22:56:14,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:14,896 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:14,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:56:14,896 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:14,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:14,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1631419929, now seen corresponding path program 1 times [2022-12-05 22:56:14,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:14,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863096686] [2022-12-05 22:56:14,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:14,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:14,991 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-05 22:56:14,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:14,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863096686] [2022-12-05 22:56:14,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863096686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:14,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:14,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:56:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636849459] [2022-12-05 22:56:14,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:14,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:56:14,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:14,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:56:14,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:56:14,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 22:56:14,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 342 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-05 22:56:14,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:14,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 22:56:14,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:15,593 INFO L130 PetriNetUnfolder]: 6533/9074 cut-off events. [2022-12-05 22:56:15,594 INFO L131 PetriNetUnfolder]: For 16458/16458 co-relation queries the response was YES. [2022-12-05 22:56:15,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29913 conditions, 9074 events. 6533/9074 cut-off events. For 16458/16458 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 44640 event pairs, 1101 based on Foata normal form. 24/9098 useless extension candidates. Maximal degree in co-relation 29894. Up to 5097 conditions per place. [2022-12-05 22:56:15,627 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 58 selfloop transitions, 29 changer transitions 0/87 dead transitions. [2022-12-05 22:56:15,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 87 transitions, 668 flow [2022-12-05 22:56:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:56:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:56:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-05 22:56:15,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-05 22:56:15,629 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 342 flow. Second operand 4 states and 65 transitions. [2022-12-05 22:56:15,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 87 transitions, 668 flow [2022-12-05 22:56:15,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 87 transitions, 668 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 22:56:15,655 INFO L231 Difference]: Finished difference. Result has 52 places, 57 transitions, 510 flow [2022-12-05 22:56:15,655 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=510, PETRI_PLACES=52, PETRI_TRANSITIONS=57} [2022-12-05 22:56:15,656 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2022-12-05 22:56:15,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:15,656 INFO L89 Accepts]: Start accepts. Operand has 52 places, 57 transitions, 510 flow [2022-12-05 22:56:15,657 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:15,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:15,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 57 transitions, 510 flow [2022-12-05 22:56:15,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 57 transitions, 510 flow [2022-12-05 22:56:15,682 INFO L130 PetriNetUnfolder]: 173/407 cut-off events. [2022-12-05 22:56:15,683 INFO L131 PetriNetUnfolder]: For 1421/1722 co-relation queries the response was YES. [2022-12-05 22:56:15,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 407 events. 173/407 cut-off events. For 1421/1722 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2228 event pairs, 38 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 1616. Up to 210 conditions per place. [2022-12-05 22:56:15,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 57 transitions, 510 flow [2022-12-05 22:56:15,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 642 [2022-12-05 22:56:15,689 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:15,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-05 22:56:15,690 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 510 flow [2022-12-05 22:56:15,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-05 22:56:15,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:15,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:15,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:56:15,690 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:15,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:15,691 INFO L85 PathProgramCache]: Analyzing trace with hash -965068253, now seen corresponding path program 1 times [2022-12-05 22:56:15,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:15,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510814072] [2022-12-05 22:56:15,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:15,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:15,777 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-05 22:56:15,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:15,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510814072] [2022-12-05 22:56:15,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510814072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:15,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:15,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:56:15,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520902971] [2022-12-05 22:56:15,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:15,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:56:15,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:15,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:56:15,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:56:15,779 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-05 22:56:15,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 57 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-05 22:56:15,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:15,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-05 22:56:15,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:16,506 INFO L130 PetriNetUnfolder]: 6808/9908 cut-off events. [2022-12-05 22:56:16,506 INFO L131 PetriNetUnfolder]: For 29268/29751 co-relation queries the response was YES. [2022-12-05 22:56:16,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34136 conditions, 9908 events. 6808/9908 cut-off events. For 29268/29751 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 55627 event pairs, 2679 based on Foata normal form. 366/10150 useless extension candidates. Maximal degree in co-relation 34113. Up to 5183 conditions per place. [2022-12-05 22:56:16,543 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 52 selfloop transitions, 8 changer transitions 3/75 dead transitions. [2022-12-05 22:56:16,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 719 flow [2022-12-05 22:56:16,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:56:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:56:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-05 22:56:16,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2022-12-05 22:56:16,544 INFO L175 Difference]: Start difference. First operand has 52 places, 57 transitions, 510 flow. Second operand 3 states and 46 transitions. [2022-12-05 22:56:16,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 719 flow [2022-12-05 22:56:16,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 719 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 22:56:16,584 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 523 flow [2022-12-05 22:56:16,584 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=523, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2022-12-05 22:56:16,585 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2022-12-05 22:56:16,585 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:16,585 INFO L89 Accepts]: Start accepts. Operand has 55 places, 56 transitions, 523 flow [2022-12-05 22:56:16,586 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:16,586 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:16,586 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 56 transitions, 523 flow [2022-12-05 22:56:16,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 56 transitions, 523 flow [2022-12-05 22:56:16,614 INFO L130 PetriNetUnfolder]: 161/438 cut-off events. [2022-12-05 22:56:16,614 INFO L131 PetriNetUnfolder]: For 1720/1941 co-relation queries the response was YES. [2022-12-05 22:56:16,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1766 conditions, 438 events. 161/438 cut-off events. For 1720/1941 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2628 event pairs, 40 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 1744. Up to 216 conditions per place. [2022-12-05 22:56:16,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 56 transitions, 523 flow [2022-12-05 22:56:16,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 624 [2022-12-05 22:56:16,620 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:16,621 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-05 22:56:16,621 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 523 flow [2022-12-05 22:56:16,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-05 22:56:16,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:16,621 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:16,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:56:16,621 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:16,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:16,622 INFO L85 PathProgramCache]: Analyzing trace with hash -220031620, now seen corresponding path program 1 times [2022-12-05 22:56:16,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:16,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50538483] [2022-12-05 22:56:16,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:16,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:16,770 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-05 22:56:16,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:16,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50538483] [2022-12-05 22:56:16,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50538483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:16,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:16,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:56:16,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874026340] [2022-12-05 22:56:16,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:16,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:56:16,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:16,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:56:16,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:56:16,772 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 22:56:16,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 523 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-05 22:56:16,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:16,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 22:56:16,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:17,322 INFO L130 PetriNetUnfolder]: 4235/6358 cut-off events. [2022-12-05 22:56:17,322 INFO L131 PetriNetUnfolder]: For 20274/21011 co-relation queries the response was YES. [2022-12-05 22:56:17,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21623 conditions, 6358 events. 4235/6358 cut-off events. For 20274/21011 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 36877 event pairs, 959 based on Foata normal form. 494/6619 useless extension candidates. Maximal degree in co-relation 21598. Up to 5614 conditions per place. [2022-12-05 22:56:17,354 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 65 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2022-12-05 22:56:17,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 904 flow [2022-12-05 22:56:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:56:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:56:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-05 22:56:17,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2022-12-05 22:56:17,355 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 523 flow. Second operand 3 states and 49 transitions. [2022-12-05 22:56:17,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 904 flow [2022-12-05 22:56:17,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 889 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 22:56:17,367 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 546 flow [2022-12-05 22:56:17,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2022-12-05 22:56:17,368 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2022-12-05 22:56:17,368 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:17,368 INFO L89 Accepts]: Start accepts. Operand has 57 places, 60 transitions, 546 flow [2022-12-05 22:56:17,369 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:17,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:17,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 60 transitions, 546 flow [2022-12-05 22:56:17,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 60 transitions, 546 flow [2022-12-05 22:56:17,490 INFO L130 PetriNetUnfolder]: 706/1593 cut-off events. [2022-12-05 22:56:17,491 INFO L131 PetriNetUnfolder]: For 2447/2694 co-relation queries the response was YES. [2022-12-05 22:56:17,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4391 conditions, 1593 events. 706/1593 cut-off events. For 2447/2694 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 12407 event pairs, 303 based on Foata normal form. 10/1470 useless extension candidates. Maximal degree in co-relation 4367. Up to 969 conditions per place. [2022-12-05 22:56:17,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 60 transitions, 546 flow [2022-12-05 22:56:17,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 750 [2022-12-05 22:56:17,515 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:17,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-05 22:56:17,516 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 546 flow [2022-12-05 22:56:17,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-05 22:56:17,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:17,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:17,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:56:17,516 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2071877107, now seen corresponding path program 1 times [2022-12-05 22:56:17,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:17,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904496684] [2022-12-05 22:56:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:17,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:17,626 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-05 22:56:17,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:17,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904496684] [2022-12-05 22:56:17,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904496684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:17,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:17,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:56:17,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413932350] [2022-12-05 22:56:17,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:17,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:56:17,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:17,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:56:17,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:56:17,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-05 22:56:17,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-05 22:56:17,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:17,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-05 22:56:17,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:18,333 INFO L130 PetriNetUnfolder]: 5840/8940 cut-off events. [2022-12-05 22:56:18,333 INFO L131 PetriNetUnfolder]: For 30865/31193 co-relation queries the response was YES. [2022-12-05 22:56:18,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34362 conditions, 8940 events. 5840/8940 cut-off events. For 30865/31193 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 54254 event pairs, 2537 based on Foata normal form. 324/9080 useless extension candidates. Maximal degree in co-relation 34335. Up to 4287 conditions per place. [2022-12-05 22:56:18,371 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 60 selfloop transitions, 11 changer transitions 8/86 dead transitions. [2022-12-05 22:56:18,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 86 transitions, 852 flow [2022-12-05 22:56:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:56:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:56:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-05 22:56:18,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-05 22:56:18,372 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 546 flow. Second operand 3 states and 48 transitions. [2022-12-05 22:56:18,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 86 transitions, 852 flow [2022-12-05 22:56:18,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 86 transitions, 843 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:56:18,396 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 529 flow [2022-12-05 22:56:18,396 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2022-12-05 22:56:18,397 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2022-12-05 22:56:18,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:18,397 INFO L89 Accepts]: Start accepts. Operand has 59 places, 56 transitions, 529 flow [2022-12-05 22:56:18,397 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:18,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:18,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 56 transitions, 529 flow [2022-12-05 22:56:18,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 56 transitions, 529 flow [2022-12-05 22:56:18,492 INFO L130 PetriNetUnfolder]: 863/1896 cut-off events. [2022-12-05 22:56:18,492 INFO L131 PetriNetUnfolder]: For 2969/3165 co-relation queries the response was YES. [2022-12-05 22:56:18,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4950 conditions, 1896 events. 863/1896 cut-off events. For 2969/3165 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 15174 event pairs, 401 based on Foata normal form. 10/1701 useless extension candidates. Maximal degree in co-relation 4925. Up to 1300 conditions per place. [2022-12-05 22:56:18,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 56 transitions, 529 flow [2022-12-05 22:56:18,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 678 [2022-12-05 22:56:18,521 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:18,521 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-05 22:56:18,522 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 529 flow [2022-12-05 22:56:18,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-05 22:56:18,522 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:18,522 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:18,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:56:18,522 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:18,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:18,522 INFO L85 PathProgramCache]: Analyzing trace with hash 257640661, now seen corresponding path program 1 times [2022-12-05 22:56:18,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:18,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622165997] [2022-12-05 22:56:18,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:18,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:18,620 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-05 22:56:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:18,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622165997] [2022-12-05 22:56:18,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622165997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:18,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:18,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:56:18,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934389495] [2022-12-05 22:56:18,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:18,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:56:18,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:18,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:56:18,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:56:18,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 22:56:18,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 529 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-05 22:56:18,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:18,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 22:56:18,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:18,988 INFO L130 PetriNetUnfolder]: 2686/4353 cut-off events. [2022-12-05 22:56:18,988 INFO L131 PetriNetUnfolder]: For 13411/13796 co-relation queries the response was YES. [2022-12-05 22:56:18,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16260 conditions, 4353 events. 2686/4353 cut-off events. For 13411/13796 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 26184 event pairs, 375 based on Foata normal form. 538/4771 useless extension candidates. Maximal degree in co-relation 16232. Up to 2719 conditions per place. [2022-12-05 22:56:19,003 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 86 selfloop transitions, 9 changer transitions 0/108 dead transitions. [2022-12-05 22:56:19,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 108 transitions, 1163 flow [2022-12-05 22:56:19,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:56:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:56:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-05 22:56:19,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.67 [2022-12-05 22:56:19,004 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 529 flow. Second operand 4 states and 67 transitions. [2022-12-05 22:56:19,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 108 transitions, 1163 flow [2022-12-05 22:56:19,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 108 transitions, 1137 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-05 22:56:19,013 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 568 flow [2022-12-05 22:56:19,013 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=568, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2022-12-05 22:56:19,013 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2022-12-05 22:56:19,013 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:19,013 INFO L89 Accepts]: Start accepts. Operand has 62 places, 60 transitions, 568 flow [2022-12-05 22:56:19,014 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:19,014 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:19,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 60 transitions, 568 flow [2022-12-05 22:56:19,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 568 flow [2022-12-05 22:56:19,087 INFO L130 PetriNetUnfolder]: 539/1325 cut-off events. [2022-12-05 22:56:19,087 INFO L131 PetriNetUnfolder]: For 2239/2934 co-relation queries the response was YES. [2022-12-05 22:56:19,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4533 conditions, 1325 events. 539/1325 cut-off events. For 2239/2934 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 10263 event pairs, 116 based on Foata normal form. 46/1296 useless extension candidates. Maximal degree in co-relation 4506. Up to 865 conditions per place. [2022-12-05 22:56:19,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 568 flow [2022-12-05 22:56:19,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 754 [2022-12-05 22:56:19,102 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:19,102 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-05 22:56:19,102 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 568 flow [2022-12-05 22:56:19,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-05 22:56:19,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:19,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:19,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 22:56:19,103 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:19,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:19,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1016151354, now seen corresponding path program 1 times [2022-12-05 22:56:19,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:19,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812454749] [2022-12-05 22:56:19,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:19,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:19,253 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-05 22:56:19,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:19,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812454749] [2022-12-05 22:56:19,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812454749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:19,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:19,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:56:19,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056303705] [2022-12-05 22:56:19,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:19,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:56:19,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:19,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:56:19,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:56:19,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 22:56:19,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 568 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-05 22:56:19,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:19,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 22:56:19,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:19,545 INFO L130 PetriNetUnfolder]: 1775/2926 cut-off events. [2022-12-05 22:56:19,546 INFO L131 PetriNetUnfolder]: For 10834/11312 co-relation queries the response was YES. [2022-12-05 22:56:19,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12833 conditions, 2926 events. 1775/2926 cut-off events. For 10834/11312 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16784 event pairs, 198 based on Foata normal form. 495/3330 useless extension candidates. Maximal degree in co-relation 12803. Up to 1216 conditions per place. [2022-12-05 22:56:19,558 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 96 selfloop transitions, 13 changer transitions 3/124 dead transitions. [2022-12-05 22:56:19,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 124 transitions, 1313 flow [2022-12-05 22:56:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:56:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:56:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-05 22:56:19,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.664 [2022-12-05 22:56:19,559 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 568 flow. Second operand 5 states and 83 transitions. [2022-12-05 22:56:19,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 124 transitions, 1313 flow [2022-12-05 22:56:19,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 124 transitions, 1295 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 22:56:19,568 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 610 flow [2022-12-05 22:56:19,569 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=610, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2022-12-05 22:56:19,569 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2022-12-05 22:56:19,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:19,569 INFO L89 Accepts]: Start accepts. Operand has 65 places, 63 transitions, 610 flow [2022-12-05 22:56:19,570 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:19,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:19,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 63 transitions, 610 flow [2022-12-05 22:56:19,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 63 transitions, 610 flow [2022-12-05 22:56:19,619 INFO L130 PetriNetUnfolder]: 356/876 cut-off events. [2022-12-05 22:56:19,619 INFO L131 PetriNetUnfolder]: For 2140/2683 co-relation queries the response was YES. [2022-12-05 22:56:19,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3495 conditions, 876 events. 356/876 cut-off events. For 2140/2683 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5956 event pairs, 32 based on Foata normal form. 65/888 useless extension candidates. Maximal degree in co-relation 3467. Up to 485 conditions per place. [2022-12-05 22:56:19,626 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 63 transitions, 610 flow [2022-12-05 22:56:19,626 INFO L188 LiptonReduction]: Number of co-enabled transitions 694 [2022-12-05 22:56:19,628 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:19,629 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-05 22:56:19,629 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 610 flow [2022-12-05 22:56:19,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-05 22:56:19,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:19,629 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:19,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 22:56:19,629 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:19,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:19,629 INFO L85 PathProgramCache]: Analyzing trace with hash -784652282, now seen corresponding path program 1 times [2022-12-05 22:56:19,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:19,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941841779] [2022-12-05 22:56:19,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:19,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:19,763 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-05 22:56:19,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:19,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941841779] [2022-12-05 22:56:19,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941841779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:19,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:19,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:56:19,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697683568] [2022-12-05 22:56:19,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:19,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:56:19,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:19,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:56:19,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:56:19,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 22:56:19,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 610 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-05 22:56:19,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:19,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 22:56:19,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:20,033 INFO L130 PetriNetUnfolder]: 1643/2650 cut-off events. [2022-12-05 22:56:20,033 INFO L131 PetriNetUnfolder]: For 11045/11535 co-relation queries the response was YES. [2022-12-05 22:56:20,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12121 conditions, 2650 events. 1643/2650 cut-off events. For 11045/11535 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 14860 event pairs, 182 based on Foata normal form. 356/2916 useless extension candidates. Maximal degree in co-relation 12090. Up to 977 conditions per place. [2022-12-05 22:56:20,041 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 65 selfloop transitions, 17 changer transitions 34/123 dead transitions. [2022-12-05 22:56:20,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 123 transitions, 1331 flow [2022-12-05 22:56:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:56:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:56:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-12-05 22:56:20,042 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-05 22:56:20,042 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 610 flow. Second operand 6 states and 86 transitions. [2022-12-05 22:56:20,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 123 transitions, 1331 flow [2022-12-05 22:56:20,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 123 transitions, 1268 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-05 22:56:20,069 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 404 flow [2022-12-05 22:56:20,069 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2022-12-05 22:56:20,069 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2022-12-05 22:56:20,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:20,069 INFO L89 Accepts]: Start accepts. Operand has 66 places, 48 transitions, 404 flow [2022-12-05 22:56:20,070 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:20,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:20,070 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 48 transitions, 404 flow [2022-12-05 22:56:20,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 48 transitions, 404 flow [2022-12-05 22:56:20,079 INFO L130 PetriNetUnfolder]: 49/130 cut-off events. [2022-12-05 22:56:20,079 INFO L131 PetriNetUnfolder]: For 319/373 co-relation queries the response was YES. [2022-12-05 22:56:20,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 130 events. 49/130 cut-off events. For 319/373 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 437 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 488. Up to 42 conditions per place. [2022-12-05 22:56:20,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 48 transitions, 404 flow [2022-12-05 22:56:20,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-05 22:56:20,340 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:56:20,341 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-05 22:56:20,341 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 400 flow [2022-12-05 22:56:20,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-05 22:56:20,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:20,341 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:20,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 22:56:20,341 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:20,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1045448086, now seen corresponding path program 1 times [2022-12-05 22:56:20,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:20,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968980438] [2022-12-05 22:56:20,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:20,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:20,458 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-05 22:56:20,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:20,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968980438] [2022-12-05 22:56:20,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968980438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:20,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:20,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:56:20,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550065144] [2022-12-05 22:56:20,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:20,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:56:20,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:20,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:56:20,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:56:20,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-05 22:56:20,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 400 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-05 22:56:20,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:20,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-05 22:56:20,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:20,548 INFO L130 PetriNetUnfolder]: 377/663 cut-off events. [2022-12-05 22:56:20,548 INFO L131 PetriNetUnfolder]: For 2880/2890 co-relation queries the response was YES. [2022-12-05 22:56:20,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3168 conditions, 663 events. 377/663 cut-off events. For 2880/2890 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2625 event pairs, 73 based on Foata normal form. 11/670 useless extension candidates. Maximal degree in co-relation 3138. Up to 415 conditions per place. [2022-12-05 22:56:20,551 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 34 selfloop transitions, 1 changer transitions 42/79 dead transitions. [2022-12-05 22:56:20,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 79 transitions, 780 flow [2022-12-05 22:56:20,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:56:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:56:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-05 22:56:20,552 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.532608695652174 [2022-12-05 22:56:20,552 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 400 flow. Second operand 4 states and 49 transitions. [2022-12-05 22:56:20,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 79 transitions, 780 flow [2022-12-05 22:56:20,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 640 flow, removed 27 selfloop flow, removed 10 redundant places. [2022-12-05 22:56:20,558 INFO L231 Difference]: Finished difference. Result has 59 places, 35 transitions, 217 flow [2022-12-05 22:56:20,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=59, PETRI_TRANSITIONS=35} [2022-12-05 22:56:20,559 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2022-12-05 22:56:20,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:20,560 INFO L89 Accepts]: Start accepts. Operand has 59 places, 35 transitions, 217 flow [2022-12-05 22:56:20,561 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:20,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:20,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 35 transitions, 217 flow [2022-12-05 22:56:20,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 35 transitions, 217 flow [2022-12-05 22:56:20,566 INFO L130 PetriNetUnfolder]: 22/69 cut-off events. [2022-12-05 22:56:20,566 INFO L131 PetriNetUnfolder]: For 224/251 co-relation queries the response was YES. [2022-12-05 22:56:20,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 69 events. 22/69 cut-off events. For 224/251 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 163 event pairs, 0 based on Foata normal form. 6/70 useless extension candidates. Maximal degree in co-relation 220. Up to 20 conditions per place. [2022-12-05 22:56:20,567 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 35 transitions, 217 flow [2022-12-05 22:56:20,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 22:56:20,568 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [382] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [445] $Ultimate##0-->L781: Formula: (and (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5) (= v_~y~0_17 2)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~y~0] [2022-12-05 22:56:20,582 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [463] $Ultimate##0-->L766: Formula: (and (= v_~x~0_23 2) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] [2022-12-05 22:56:21,113 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 22:56:21,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 556 [2022-12-05 22:56:21,115 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 175 flow [2022-12-05 22:56:21,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-05 22:56:21,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:21,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:21,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 22:56:21,115 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:21,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:21,115 INFO L85 PathProgramCache]: Analyzing trace with hash -248479323, now seen corresponding path program 1 times [2022-12-05 22:56:21,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:21,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641204918] [2022-12-05 22:56:21,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:21,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:21,625 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-05 22:56:21,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:21,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641204918] [2022-12-05 22:56:21,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641204918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:21,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:21,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:56:21,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84463140] [2022-12-05 22:56:21,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:21,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:56:21,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:21,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:56:21,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:56:21,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 22:56:21,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 29 transitions, 175 flow. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-05 22:56:21,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:21,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 22:56:21,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:21,702 INFO L130 PetriNetUnfolder]: 67/131 cut-off events. [2022-12-05 22:56:21,702 INFO L131 PetriNetUnfolder]: For 378/378 co-relation queries the response was YES. [2022-12-05 22:56:21,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 131 events. 67/131 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 390 event pairs, 4 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 496. Up to 58 conditions per place. [2022-12-05 22:56:21,703 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 3 changer transitions 28/61 dead transitions. [2022-12-05 22:56:21,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 492 flow [2022-12-05 22:56:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:56:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:56:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-12-05 22:56:21,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2022-12-05 22:56:21,704 INFO L175 Difference]: Start difference. First operand has 49 places, 29 transitions, 175 flow. Second operand 6 states and 30 transitions. [2022-12-05 22:56:21,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 492 flow [2022-12-05 22:56:21,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 440 flow, removed 19 selfloop flow, removed 12 redundant places. [2022-12-05 22:56:21,706 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 152 flow [2022-12-05 22:56:21,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2022-12-05 22:56:21,707 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-05 22:56:21,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:21,707 INFO L89 Accepts]: Start accepts. Operand has 44 places, 29 transitions, 152 flow [2022-12-05 22:56:21,707 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:21,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:21,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 29 transitions, 152 flow [2022-12-05 22:56:21,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 29 transitions, 152 flow [2022-12-05 22:56:21,711 INFO L130 PetriNetUnfolder]: 17/45 cut-off events. [2022-12-05 22:56:21,711 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-05 22:56:21,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 45 events. 17/45 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 78 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 123. Up to 14 conditions per place. [2022-12-05 22:56:21,711 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 29 transitions, 152 flow [2022-12-05 22:56:21,711 INFO L188 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-05 22:56:21,996 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [526] $Ultimate##0-->L781: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_23 |v_P1Thread1of1ForFork1_#in~arg.base_23|) (= v_~a~0_38 1) (= v_~x~0_95 2) (= v_P0Thread1of1ForFork3_~arg.base_15 |v_P0Thread1of1ForFork3_#in~arg.base_15|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_23| v_P1Thread1of1ForFork1_~arg.offset_23) (= v_P2Thread1of1ForFork2_~arg.offset_17 |v_P2Thread1of1ForFork2_#in~arg.offset_17|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_15| v_P0Thread1of1ForFork3_~arg.offset_15) (= v_~y~0_92 2) (= |v_P2Thread1of1ForFork2_#in~arg.base_17| v_P2Thread1of1ForFork2_~arg.base_17)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_17|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_15|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_17|, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_15|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_17|, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_17, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_23, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_15, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_15|, ~a~0=v_~a~0_38, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_23, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_17, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_15|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_17|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_15, ~y~0=v_~y~0_92, ~x~0=v_~x~0_95} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_~arg.offset, ~y~0, ~x~0] and [475] L754-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P0Thread1of1ForFork3_#res.offset_7| 0) (= |v_P0Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] [2022-12-05 22:56:22,244 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:56:22,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 538 [2022-12-05 22:56:22,245 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 165 flow [2022-12-05 22:56:22,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-05 22:56:22,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:22,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:22,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 22:56:22,245 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:22,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:22,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2055682061, now seen corresponding path program 1 times [2022-12-05 22:56:22,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:22,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054503262] [2022-12-05 22:56:22,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:22,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:56:22,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 22:56:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:56:22,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 22:56:22,358 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 22:56:22,359 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 22:56:22,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 22:56:22,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 22:56:22,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 22:56:22,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 22:56:22,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 22:56:22,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 22:56:22,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 22:56:22,362 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:22,366 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:56:22,366 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:56:22,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:56:22 BasicIcfg [2022-12-05 22:56:22,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:56:22,435 INFO L158 Benchmark]: Toolchain (without parser) took 16352.83ms. Allocated memory was 217.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 191.4MB in the beginning and 515.1MB in the end (delta: -323.7MB). Peak memory consumption was 767.3MB. Max. memory is 8.0GB. [2022-12-05 22:56:22,435 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 217.1MB. Free memory was 193.9MB in the beginning and 193.8MB in the end (delta: 86.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:56:22,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.00ms. Allocated memory is still 217.1MB. Free memory was 191.3MB in the beginning and 163.1MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 22:56:22,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.36ms. Allocated memory is still 217.1MB. Free memory was 163.1MB in the beginning and 160.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 22:56:22,436 INFO L158 Benchmark]: Boogie Preprocessor took 22.44ms. Allocated memory is still 217.1MB. Free memory was 160.4MB in the beginning and 158.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:56:22,436 INFO L158 Benchmark]: RCFGBuilder took 538.60ms. Allocated memory is still 217.1MB. Free memory was 158.3MB in the beginning and 119.5MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-05 22:56:22,436 INFO L158 Benchmark]: TraceAbstraction took 15275.24ms. Allocated memory was 217.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 118.5MB in the beginning and 515.1MB in the end (delta: -396.6MB). Peak memory consumption was 693.9MB. Max. memory is 8.0GB. [2022-12-05 22:56:22,437 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 217.1MB. Free memory was 193.9MB in the beginning and 193.8MB in the end (delta: 86.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.00ms. Allocated memory is still 217.1MB. Free memory was 191.3MB in the beginning and 163.1MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.36ms. Allocated memory is still 217.1MB. Free memory was 163.1MB in the beginning and 160.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.44ms. Allocated memory is still 217.1MB. Free memory was 160.4MB in the beginning and 158.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 538.60ms. Allocated memory is still 217.1MB. Free memory was 158.3MB in the beginning and 119.5MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 15275.24ms. Allocated memory was 217.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 118.5MB in the beginning and 515.1MB in the end (delta: -396.6MB). Peak memory consumption was 693.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 134 PlacesBefore, 42 PlacesAfterwards, 123 TransitionsBefore, 30 TransitionsAfterwards, 2718 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1877, independent: 1818, independent conditional: 1818, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1877, independent: 1818, independent conditional: 0, independent unconditional: 1818, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1877, independent: 1818, independent conditional: 0, independent unconditional: 1818, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1877, independent: 1818, independent conditional: 0, independent unconditional: 1818, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1568, independent: 1527, independent conditional: 0, independent unconditional: 1527, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1568, independent: 1520, independent conditional: 0, independent unconditional: 1520, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 145, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1877, independent: 291, independent conditional: 0, independent unconditional: 291, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 1568, unknown conditional: 0, unknown unconditional: 1568] , Statistics on independence cache: Total cache size (in pairs): 2360, Positive cache size: 2319, Positive conditional cache size: 0, Positive unconditional cache size: 2319, Negative cache size: 41, Negative conditional cache size: 0, 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: 0.1s, 36 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 146, independent: 122, independent conditional: 122, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 146, independent: 122, independent conditional: 4, independent unconditional: 118, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 146, independent: 122, independent conditional: 4, independent unconditional: 118, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 122, independent conditional: 4, independent unconditional: 118, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 131, independent: 111, independent conditional: 4, independent unconditional: 107, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 131, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 89, dependent conditional: 14, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 146, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 131, unknown conditional: 7, unknown unconditional: 124] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 111, Positive conditional cache size: 4, Positive unconditional cache size: 107, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, 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, 38 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 153, independent conditional: 153, 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: 165, independent: 153, independent conditional: 29, independent unconditional: 124, dependent: 12, dependent conditional: 7, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, independent: 153, independent conditional: 0, independent unconditional: 153, 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: 165, independent: 153, independent conditional: 0, independent unconditional: 153, 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: 24, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 165, independent: 131, independent conditional: 0, independent unconditional: 131, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 133, Positive conditional cache size: 4, Positive unconditional cache size: 129, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 240, independent: 225, independent conditional: 225, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 240, independent: 225, independent conditional: 27, independent unconditional: 198, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 240, independent: 225, independent conditional: 0, independent unconditional: 225, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 240, independent: 225, independent conditional: 0, independent unconditional: 225, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 240, independent: 220, independent conditional: 0, independent unconditional: 220, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 138, Positive conditional cache size: 4, Positive unconditional cache size: 134, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 386, independent: 363, independent conditional: 363, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 386, independent: 363, independent conditional: 95, independent unconditional: 268, dependent: 23, dependent conditional: 3, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 389, independent: 363, independent conditional: 0, independent unconditional: 363, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 389, independent: 363, independent conditional: 0, independent unconditional: 363, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 389, independent: 358, independent conditional: 0, independent unconditional: 358, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 143, Positive conditional cache size: 4, Positive unconditional cache size: 139, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 101, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 543, independent: 510, independent conditional: 510, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 543, independent: 510, independent conditional: 190, independent unconditional: 320, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 543, independent: 510, independent conditional: 0, independent unconditional: 510, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 543, independent: 510, independent conditional: 0, independent unconditional: 510, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 543, independent: 509, independent conditional: 0, independent unconditional: 509, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 144, Positive conditional cache size: 4, Positive unconditional cache size: 140, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 190, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 624 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 440, independent conditional: 440, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 471, independent: 440, independent conditional: 176, independent unconditional: 264, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 471, independent: 440, independent conditional: 0, independent unconditional: 440, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 471, independent: 440, independent conditional: 0, independent unconditional: 440, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 471, independent: 440, independent conditional: 0, independent unconditional: 440, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 144, Positive conditional cache size: 4, Positive unconditional cache size: 140, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 176, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 750 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 312, independent: 295, independent conditional: 295, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 312, independent: 295, independent conditional: 151, independent unconditional: 144, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 312, independent: 295, independent conditional: 32, independent unconditional: 263, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 312, independent: 295, independent conditional: 32, independent unconditional: 263, dependent: 17, dependent conditional: 0, dependent unconditional: 17, 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: 312, independent: 295, independent conditional: 32, independent unconditional: 263, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 144, Positive conditional cache size: 4, Positive unconditional cache size: 140, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 119, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 678 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 183, independent: 169, independent conditional: 83, independent unconditional: 86, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 183, independent: 169, independent conditional: 22, independent unconditional: 147, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 183, independent: 169, independent conditional: 22, independent unconditional: 147, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 183, independent: 167, independent conditional: 22, independent unconditional: 145, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 146, Positive conditional cache size: 4, Positive unconditional cache size: 142, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 61, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 754 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 222, independent: 207, independent conditional: 207, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 222, independent: 207, independent conditional: 123, independent unconditional: 84, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 222, independent: 207, independent conditional: 34, independent unconditional: 173, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222, independent: 207, independent conditional: 34, independent unconditional: 173, dependent: 15, dependent conditional: 0, dependent unconditional: 15, 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: 222, independent: 207, independent conditional: 34, independent unconditional: 173, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 146, Positive conditional cache size: 4, Positive unconditional cache size: 142, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 89, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 694 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 218, independent: 202, independent conditional: 202, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 218, independent: 202, independent conditional: 124, independent unconditional: 78, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 218, independent: 202, independent conditional: 36, independent unconditional: 166, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 218, independent: 202, independent conditional: 36, independent unconditional: 166, dependent: 16, dependent conditional: 0, dependent unconditional: 16, 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: 218, independent: 202, independent conditional: 36, independent unconditional: 166, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 146, Positive conditional cache size: 4, Positive unconditional cache size: 142, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 88, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 66 PlacesBefore, 64 PlacesAfterwards, 48 TransitionsBefore, 46 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 272, independent: 244, independent conditional: 244, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 272, independent: 244, independent conditional: 196, independent unconditional: 48, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 272, independent: 244, independent conditional: 140, independent unconditional: 104, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 272, independent: 244, independent conditional: 140, independent unconditional: 104, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 272, independent: 241, independent conditional: 137, independent unconditional: 104, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 153, Positive conditional cache size: 7, Positive unconditional cache size: 146, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 58 PlacesBefore, 49 PlacesAfterwards, 35 TransitionsBefore, 29 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 105, independent: 85, independent conditional: 60, independent unconditional: 25, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 105, independent: 85, independent conditional: 45, independent unconditional: 40, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 105, independent: 85, independent conditional: 45, independent unconditional: 40, dependent: 20, dependent conditional: 0, dependent unconditional: 20, 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: 105, independent: 78, independent conditional: 43, independent unconditional: 35, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 202, Positive conditional cache size: 9, Positive unconditional cache size: 193, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 42 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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): 302, Positive cache size: 278, Positive conditional cache size: 9, Positive unconditional cache size: 269, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L862] 0 pthread_t t557; [L863] FCALL, FORK 0 pthread_create(&t557, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t557, ((void *)0), P0, ((void *)0))=-3, t557={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 pthread_t t558; [L865] FCALL, FORK 0 pthread_create(&t558, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t558, ((void *)0), P1, ((void *)0))=-2, t557={5:0}, t558={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t559; [L867] FCALL, FORK 0 pthread_create(&t559, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t559, ((void *)0), P2, ((void *)0))=-1, t557={5:0}, t558={6:0}, t559={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t560; [L869] FCALL, FORK 0 pthread_create(&t560, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t560, ((void *)0), P3, ((void *)0))=0, t557={5:0}, t558={6:0}, t559={7:0}, t560={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 z$flush_delayed = weak$$choice2 [L824] 4 z$mem_tmp = z [L825] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L826] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L827] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L828] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L829] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L831] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = z [L833] 4 z = z$flush_delayed ? z$mem_tmp : z [L834] 4 z$flush_delayed = (_Bool)0 [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 [L753] 1 x = 1 [L765] 1 x = 2 [L768] 1 y = 1 [L780] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L840] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L841] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L842] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L844] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 865]: 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. - UnprovableResult [Line: 863]: 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: 867]: 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, 161 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: 15.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 372 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 809 IncrementalHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 19 mSDtfsCounter, 809 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=610occurred in iteration=10, InterpolantAutomatonStates: 52, 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.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-05 22:56:22,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...