/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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:04:55,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:04:55,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:04:55,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:04:55,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:04:55,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:04:55,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:04:55,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:04:55,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:04:55,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:04:55,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:04:55,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:04:55,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:04:55,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:04:55,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:04:55,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:04:55,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:04:55,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:04:55,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:04:55,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:04:55,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:04:55,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:04:55,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:04:55,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:04:55,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:04:55,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:04:55,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:04:55,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:04:55,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:04:55,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:04:55,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:04:55,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:04:55,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:04:55,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:04:55,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:04:55,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:04:55,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:04:55,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:04:55,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:04:55,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:04:55,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:04:55,335 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 23:04:55,366 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:04:55,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:04:55,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:04:55,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:04:55,369 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:04:55,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:04:55,370 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:04:55,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:04:55,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:04:55,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:04:55,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:04:55,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:04:55,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:04:55,371 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:04:55,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:04:55,372 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:04:55,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:04:55,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:04:55,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:04:55,372 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:04:55,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:04:55,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:04:55,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:04:55,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:04:55,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:04:55,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:04:55,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:04:55,373 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:04:55,373 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 23:04:55,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:04:55,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:04:55,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:04:55,697 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:04:55,697 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:04:55,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 23:04:56,760 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:04:57,047 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:04:57,048 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 23:04:57,062 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec837efa/b505cd17b38c472e8dd6212ff445718e/FLAGfc8be3e9d [2022-12-05 23:04:57,078 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec837efa/b505cd17b38c472e8dd6212ff445718e [2022-12-05 23:04:57,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:04:57,081 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:04:57,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:04:57,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:04:57,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:04:57,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:04:57" (1/1) ... [2022-12-05 23:04:57,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45bc055a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:57, skipping insertion in model container [2022-12-05 23:04:57,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:04:57" (1/1) ... [2022-12-05 23:04:57,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:04:57,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:04:57,253 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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 23:04:57,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:04:57,435 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:04:57,448 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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 23:04:57,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:57,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:57,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:04:57,576 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:04:57,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:57 WrapperNode [2022-12-05 23:04:57,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:04:57,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:04:57,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:04:57,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:04:57,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:57" (1/1) ... [2022-12-05 23:04:57,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:57" (1/1) ... [2022-12-05 23:04:57,657 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-12-05 23:04:57,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:04:57,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:04:57,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:04:57,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:04:57,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:57" (1/1) ... [2022-12-05 23:04:57,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:57" (1/1) ... [2022-12-05 23:04:57,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:57" (1/1) ... [2022-12-05 23:04:57,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:57" (1/1) ... [2022-12-05 23:04:57,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:57" (1/1) ... [2022-12-05 23:04:57,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:57" (1/1) ... [2022-12-05 23:04:57,704 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:57" (1/1) ... [2022-12-05 23:04:57,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:57" (1/1) ... [2022-12-05 23:04:57,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:04:57,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:04:57,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:04:57,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:04:57,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:57" (1/1) ... [2022-12-05 23:04:57,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:04:57,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:04:57,747 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 23:04:57,769 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 23:04:57,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:04:57,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:04:57,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:04:57,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:04:57,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:04:57,786 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:04:57,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:04:57,786 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:04:57,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:04:57,787 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:04:57,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:04:57,787 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 23:04:57,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 23:04:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:04:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:04:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:04:57,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:04:57,789 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 23:04:57,978 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:04:57,980 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:04:58,276 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:04:58,382 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:04:58,382 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:04:58,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:04:58 BoogieIcfgContainer [2022-12-05 23:04:58,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:04:58,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:04:58,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:04:58,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:04:58,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:04:57" (1/3) ... [2022-12-05 23:04:58,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755524d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:04:58, skipping insertion in model container [2022-12-05 23:04:58,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:57" (2/3) ... [2022-12-05 23:04:58,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755524d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:04:58, skipping insertion in model container [2022-12-05 23:04:58,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:04:58" (3/3) ... [2022-12-05 23:04:58,391 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 23:04:58,425 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:04:58,425 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:04:58,426 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:04:58,482 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:04:58,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-05 23:04:58,598 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-05 23:04:58,599 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:58,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 23:04:58,606 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-05 23:04:58,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-05 23:04:58,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:58,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-05 23:04:58,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-05 23:04:58,691 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-05 23:04:58,692 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:58,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 23:04:58,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-05 23:04:58,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 2936 [2022-12-05 23:05:04,406 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-05 23:05:04,424 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:05:04,431 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;@f45e0cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:05:04,431 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 23:05:04,446 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-05 23:05:04,446 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:05:04,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:04,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:04,447 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 23:05:04,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:04,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1514565341, now seen corresponding path program 1 times [2022-12-05 23:05:04,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:04,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876585372] [2022-12-05 23:05:04,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:04,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:04,921 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 23:05:04,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:04,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876585372] [2022-12-05 23:05:04,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876585372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:04,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:04,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:05:04,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561674013] [2022-12-05 23:05:04,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:04,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:05:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:04,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:05:04,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:05:04,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2022-12-05 23:05:04,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 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 23:05:04,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:04,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2022-12-05 23:05:04,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:05,491 INFO L130 PetriNetUnfolder]: 2891/4513 cut-off events. [2022-12-05 23:05:05,491 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-05 23:05:05,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8613 conditions, 4513 events. 2891/4513 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 26826 event pairs, 668 based on Foata normal form. 0/4212 useless extension candidates. Maximal degree in co-relation 8601. Up to 2980 conditions per place. [2022-12-05 23:05:05,520 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 31 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2022-12-05 23:05:05,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 170 flow [2022-12-05 23:05:05,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:05:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:05:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-05 23:05:05,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.59375 [2022-12-05 23:05:05,531 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 57 transitions. [2022-12-05 23:05:05,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 170 flow [2022-12-05 23:05:05,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:05:05,536 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2022-12-05 23:05:05,538 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-12-05 23:05:05,541 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2022-12-05 23:05:05,541 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:05,541 INFO L89 Accepts]: Start accepts. Operand has 40 places, 27 transitions, 66 flow [2022-12-05 23:05:05,543 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:05,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:05,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 27 transitions, 66 flow [2022-12-05 23:05:05,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 66 flow [2022-12-05 23:05:05,550 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-05 23:05:05,550 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:05:05,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 27 events. 0/27 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/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:05:05,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 66 flow [2022-12-05 23:05:05,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-05 23:05:05,868 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:05:05,870 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 329 [2022-12-05 23:05:05,870 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 64 flow [2022-12-05 23:05:05,870 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 23:05:05,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:05,870 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:05,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:05:05,871 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 23:05:05,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash -496507795, now seen corresponding path program 1 times [2022-12-05 23:05:05,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:05,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997719216] [2022-12-05 23:05:05,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:05,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:06,285 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 23:05:06,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:06,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997719216] [2022-12-05 23:05:06,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997719216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:06,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:06,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:05:06,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554384141] [2022-12-05 23:05:06,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:06,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:05:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:06,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:05:06,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:05:06,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 23:05:06,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 64 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 23:05:06,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:06,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 23:05:06,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:07,354 INFO L130 PetriNetUnfolder]: 7719/10640 cut-off events. [2022-12-05 23:05:07,354 INFO L131 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2022-12-05 23:05:07,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21726 conditions, 10640 events. 7719/10640 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 50798 event pairs, 1847 based on Foata normal form. 400/11040 useless extension candidates. Maximal degree in co-relation 21716. Up to 5729 conditions per place. [2022-12-05 23:05:07,415 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 43 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2022-12-05 23:05:07,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 53 transitions, 224 flow [2022-12-05 23:05:07,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:05:07,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:05:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-05 23:05:07,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5288461538461539 [2022-12-05 23:05:07,418 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 64 flow. Second operand 4 states and 55 transitions. [2022-12-05 23:05:07,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 53 transitions, 224 flow [2022-12-05 23:05:07,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:05:07,423 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 136 flow [2022-12-05 23:05:07,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-05 23:05:07,424 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2022-12-05 23:05:07,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:07,424 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 136 flow [2022-12-05 23:05:07,425 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:07,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:07,425 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 136 flow [2022-12-05 23:05:07,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 136 flow [2022-12-05 23:05:07,518 INFO L130 PetriNetUnfolder]: 534/999 cut-off events. [2022-12-05 23:05:07,518 INFO L131 PetriNetUnfolder]: For 185/250 co-relation queries the response was YES. [2022-12-05 23:05:07,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2244 conditions, 999 events. 534/999 cut-off events. For 185/250 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5875 event pairs, 225 based on Foata normal form. 0/950 useless extension candidates. Maximal degree in co-relation 2234. Up to 596 conditions per place. [2022-12-05 23:05:07,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 136 flow [2022-12-05 23:05:07,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-05 23:05:07,555 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:07,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-05 23:05:07,557 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 136 flow [2022-12-05 23:05:07,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 23:05:07,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:07,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:07,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:05:07,557 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 23:05:07,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:07,558 INFO L85 PathProgramCache]: Analyzing trace with hash -402321547, now seen corresponding path program 1 times [2022-12-05 23:05:07,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:07,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842006318] [2022-12-05 23:05:07,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:07,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:07,885 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 23:05:07,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:07,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842006318] [2022-12-05 23:05:07,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842006318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:07,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:07,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:05:07,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716011405] [2022-12-05 23:05:07,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:07,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:05:07,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:07,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:05:07,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:05:07,887 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 23:05:07,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 136 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 23:05:07,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:07,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 23:05:07,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:09,256 INFO L130 PetriNetUnfolder]: 8653/11938 cut-off events. [2022-12-05 23:05:09,257 INFO L131 PetriNetUnfolder]: For 5351/5351 co-relation queries the response was YES. [2022-12-05 23:05:09,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32653 conditions, 11938 events. 8653/11938 cut-off events. For 5351/5351 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 59698 event pairs, 779 based on Foata normal form. 40/11978 useless extension candidates. Maximal degree in co-relation 32640. Up to 7441 conditions per place. [2022-12-05 23:05:09,345 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 54 selfloop transitions, 20 changer transitions 0/74 dead transitions. [2022-12-05 23:05:09,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 412 flow [2022-12-05 23:05:09,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:05:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:05:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-05 23:05:09,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-05 23:05:09,348 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 136 flow. Second operand 4 states and 68 transitions. [2022-12-05 23:05:09,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 74 transitions, 412 flow [2022-12-05 23:05:09,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 408 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:05:09,365 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 277 flow [2022-12-05 23:05:09,365 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2022-12-05 23:05:09,367 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2022-12-05 23:05:09,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:09,367 INFO L89 Accepts]: Start accepts. Operand has 46 places, 45 transitions, 277 flow [2022-12-05 23:05:09,369 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:09,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:09,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 277 flow [2022-12-05 23:05:09,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 277 flow [2022-12-05 23:05:09,522 INFO L130 PetriNetUnfolder]: 709/1300 cut-off events. [2022-12-05 23:05:09,522 INFO L131 PetriNetUnfolder]: For 1440/1554 co-relation queries the response was YES. [2022-12-05 23:05:09,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4246 conditions, 1300 events. 709/1300 cut-off events. For 1440/1554 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7892 event pairs, 255 based on Foata normal form. 0/1268 useless extension candidates. Maximal degree in co-relation 4232. Up to 695 conditions per place. [2022-12-05 23:05:09,539 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 277 flow [2022-12-05 23:05:09,539 INFO L188 LiptonReduction]: Number of co-enabled transitions 476 [2022-12-05 23:05:09,579 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:09,581 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-05 23:05:09,581 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 277 flow [2022-12-05 23:05:09,581 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 23:05:09,581 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:09,581 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:09,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:05:09,581 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 23:05:09,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:09,582 INFO L85 PathProgramCache]: Analyzing trace with hash 412934032, now seen corresponding path program 1 times [2022-12-05 23:05:09,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:09,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360227415] [2022-12-05 23:05:09,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:09,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:09,823 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 23:05:09,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:09,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360227415] [2022-12-05 23:05:09,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360227415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:09,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:09,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:05:09,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652384877] [2022-12-05 23:05:09,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:09,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:05:09,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:09,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:05:09,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:05:09,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 23:05:09,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 23:05:09,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:09,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 23:05:09,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:10,784 INFO L130 PetriNetUnfolder]: 5754/8413 cut-off events. [2022-12-05 23:05:10,784 INFO L131 PetriNetUnfolder]: For 15345/15409 co-relation queries the response was YES. [2022-12-05 23:05:10,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28898 conditions, 8413 events. 5754/8413 cut-off events. For 15345/15409 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 47555 event pairs, 1186 based on Foata normal form. 40/8195 useless extension candidates. Maximal degree in co-relation 28881. Up to 6964 conditions per place. [2022-12-05 23:05:10,862 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 53 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2022-12-05 23:05:10,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 545 flow [2022-12-05 23:05:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:05:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:05:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-05 23:05:10,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2022-12-05 23:05:10,865 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 277 flow. Second operand 3 states and 49 transitions. [2022-12-05 23:05:10,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 545 flow [2022-12-05 23:05:10,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 545 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:05:10,872 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 360 flow [2022-12-05 23:05:10,872 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2022-12-05 23:05:10,873 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2022-12-05 23:05:10,873 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:10,873 INFO L89 Accepts]: Start accepts. Operand has 49 places, 51 transitions, 360 flow [2022-12-05 23:05:10,875 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:10,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:10,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 51 transitions, 360 flow [2022-12-05 23:05:10,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 360 flow [2022-12-05 23:05:10,995 INFO L130 PetriNetUnfolder]: 679/1262 cut-off events. [2022-12-05 23:05:10,996 INFO L131 PetriNetUnfolder]: For 1825/1947 co-relation queries the response was YES. [2022-12-05 23:05:11,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4428 conditions, 1262 events. 679/1262 cut-off events. For 1825/1947 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7710 event pairs, 250 based on Foata normal form. 1/1231 useless extension candidates. Maximal degree in co-relation 4411. Up to 665 conditions per place. [2022-12-05 23:05:11,012 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 51 transitions, 360 flow [2022-12-05 23:05:11,012 INFO L188 LiptonReduction]: Number of co-enabled transitions 526 [2022-12-05 23:05:11,037 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:11,041 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-05 23:05:11,041 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 360 flow [2022-12-05 23:05:11,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 23:05:11,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:11,041 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:11,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:05:11,042 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 23:05:11,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:11,042 INFO L85 PathProgramCache]: Analyzing trace with hash 350774423, now seen corresponding path program 1 times [2022-12-05 23:05:11,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:11,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631638497] [2022-12-05 23:05:11,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:11,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:11,394 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 23:05:11,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:11,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631638497] [2022-12-05 23:05:11,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631638497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:11,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:11,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:05:11,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338010250] [2022-12-05 23:05:11,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:11,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:05:11,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:11,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:05:11,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:05:11,397 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 23:05:11,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 360 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 23:05:11,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:11,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 23:05:11,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:12,851 INFO L130 PetriNetUnfolder]: 10773/15034 cut-off events. [2022-12-05 23:05:12,852 INFO L131 PetriNetUnfolder]: For 26534/26534 co-relation queries the response was YES. [2022-12-05 23:05:12,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52246 conditions, 15034 events. 10773/15034 cut-off events. For 26534/26534 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 79293 event pairs, 2231 based on Foata normal form. 160/15194 useless extension candidates. Maximal degree in co-relation 52226. Up to 6843 conditions per place. [2022-12-05 23:05:12,963 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 63 selfloop transitions, 29 changer transitions 2/94 dead transitions. [2022-12-05 23:05:12,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 94 transitions, 755 flow [2022-12-05 23:05:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:05:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:05:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-05 23:05:12,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6442307692307693 [2022-12-05 23:05:12,965 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 360 flow. Second operand 4 states and 67 transitions. [2022-12-05 23:05:12,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 94 transitions, 755 flow [2022-12-05 23:05:12,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 94 transitions, 747 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:05:12,974 INFO L231 Difference]: Finished difference. Result has 54 places, 64 transitions, 604 flow [2022-12-05 23:05:12,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=604, PETRI_PLACES=54, PETRI_TRANSITIONS=64} [2022-12-05 23:05:12,976 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2022-12-05 23:05:12,976 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:12,976 INFO L89 Accepts]: Start accepts. Operand has 54 places, 64 transitions, 604 flow [2022-12-05 23:05:12,977 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:12,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:12,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 64 transitions, 604 flow [2022-12-05 23:05:12,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 64 transitions, 604 flow [2022-12-05 23:05:13,151 INFO L130 PetriNetUnfolder]: 672/1315 cut-off events. [2022-12-05 23:05:13,152 INFO L131 PetriNetUnfolder]: For 3622/4009 co-relation queries the response was YES. [2022-12-05 23:05:13,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5650 conditions, 1315 events. 672/1315 cut-off events. For 3622/4009 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8428 event pairs, 201 based on Foata normal form. 1/1302 useless extension candidates. Maximal degree in co-relation 5629. Up to 714 conditions per place. [2022-12-05 23:05:13,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 64 transitions, 604 flow [2022-12-05 23:05:13,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-05 23:05:13,196 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:13,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-05 23:05:13,198 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 64 transitions, 604 flow [2022-12-05 23:05:13,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 23:05:13,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:13,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:13,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:05:13,199 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 23:05:13,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:13,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1295743669, now seen corresponding path program 1 times [2022-12-05 23:05:13,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:13,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923719700] [2022-12-05 23:05:13,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:13,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:14,223 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 23:05:14,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:14,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923719700] [2022-12-05 23:05:14,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923719700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:14,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:14,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:05:14,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298676285] [2022-12-05 23:05:14,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:14,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:05:14,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:14,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:05:14,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:05:14,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 23:05:14,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 64 transitions, 604 flow. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 23:05:14,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:14,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 23:05:14,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:15,689 INFO L130 PetriNetUnfolder]: 11407/15964 cut-off events. [2022-12-05 23:05:15,689 INFO L131 PetriNetUnfolder]: For 55570/55570 co-relation queries the response was YES. [2022-12-05 23:05:15,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64446 conditions, 15964 events. 11407/15964 cut-off events. For 55570/55570 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 84601 event pairs, 2449 based on Foata normal form. 56/16020 useless extension candidates. Maximal degree in co-relation 64422. Up to 12551 conditions per place. [2022-12-05 23:05:15,780 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 123 selfloop transitions, 39 changer transitions 15/177 dead transitions. [2022-12-05 23:05:15,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 177 transitions, 1978 flow [2022-12-05 23:05:15,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:05:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:05:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-05 23:05:15,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2022-12-05 23:05:15,782 INFO L175 Difference]: Start difference. First operand has 54 places, 64 transitions, 604 flow. Second operand 6 states and 84 transitions. [2022-12-05 23:05:15,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 177 transitions, 1978 flow [2022-12-05 23:05:15,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 177 transitions, 1950 flow, removed 14 selfloop flow, removed 0 redundant places. [2022-12-05 23:05:15,846 INFO L231 Difference]: Finished difference. Result has 63 places, 98 transitions, 1131 flow [2022-12-05 23:05:15,847 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1131, PETRI_PLACES=63, PETRI_TRANSITIONS=98} [2022-12-05 23:05:15,847 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2022-12-05 23:05:15,847 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:15,848 INFO L89 Accepts]: Start accepts. Operand has 63 places, 98 transitions, 1131 flow [2022-12-05 23:05:15,850 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:15,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:15,850 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 98 transitions, 1131 flow [2022-12-05 23:05:15,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 98 transitions, 1131 flow [2022-12-05 23:05:16,094 INFO L130 PetriNetUnfolder]: 1136/2137 cut-off events. [2022-12-05 23:05:16,095 INFO L131 PetriNetUnfolder]: For 8294/9038 co-relation queries the response was YES. [2022-12-05 23:05:16,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10830 conditions, 2137 events. 1136/2137 cut-off events. For 8294/9038 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 14248 event pairs, 226 based on Foata normal form. 37/2158 useless extension candidates. Maximal degree in co-relation 10803. Up to 1157 conditions per place. [2022-12-05 23:05:16,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 98 transitions, 1131 flow [2022-12-05 23:05:16,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 854 [2022-12-05 23:05:16,163 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:16,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 317 [2022-12-05 23:05:16,164 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 98 transitions, 1131 flow [2022-12-05 23:05:16,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 23:05:16,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:16,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:16,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:05:16,164 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 23:05:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1295446069, now seen corresponding path program 2 times [2022-12-05 23:05:16,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:16,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565758039] [2022-12-05 23:05:16,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:16,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:16,574 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 23:05:16,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:16,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565758039] [2022-12-05 23:05:16,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565758039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:16,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:16,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:05:16,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602997232] [2022-12-05 23:05:16,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:16,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:05:16,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:16,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:05:16,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:05:16,576 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 23:05:16,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 98 transitions, 1131 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 23:05:16,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:16,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 23:05:16,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:17,688 INFO L130 PetriNetUnfolder]: 8651/12833 cut-off events. [2022-12-05 23:05:17,688 INFO L131 PetriNetUnfolder]: For 63495/64384 co-relation queries the response was YES. [2022-12-05 23:05:17,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59291 conditions, 12833 events. 8651/12833 cut-off events. For 63495/64384 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 76966 event pairs, 2005 based on Foata normal form. 514/13185 useless extension candidates. Maximal degree in co-relation 59261. Up to 9079 conditions per place. [2022-12-05 23:05:17,782 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 90 selfloop transitions, 19 changer transitions 1/136 dead transitions. [2022-12-05 23:05:17,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 136 transitions, 1709 flow [2022-12-05 23:05:17,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:05:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:05:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-05 23:05:17,784 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5673076923076923 [2022-12-05 23:05:17,784 INFO L175 Difference]: Start difference. First operand has 63 places, 98 transitions, 1131 flow. Second operand 4 states and 59 transitions. [2022-12-05 23:05:17,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 136 transitions, 1709 flow [2022-12-05 23:05:17,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 136 transitions, 1618 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-05 23:05:17,884 INFO L231 Difference]: Finished difference. Result has 67 places, 106 transitions, 1209 flow [2022-12-05 23:05:17,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1209, PETRI_PLACES=67, PETRI_TRANSITIONS=106} [2022-12-05 23:05:17,885 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2022-12-05 23:05:17,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:17,885 INFO L89 Accepts]: Start accepts. Operand has 67 places, 106 transitions, 1209 flow [2022-12-05 23:05:17,886 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:17,886 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:17,887 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 106 transitions, 1209 flow [2022-12-05 23:05:17,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 106 transitions, 1209 flow [2022-12-05 23:05:18,234 INFO L130 PetriNetUnfolder]: 1109/2078 cut-off events. [2022-12-05 23:05:18,234 INFO L131 PetriNetUnfolder]: For 8220/8795 co-relation queries the response was YES. [2022-12-05 23:05:18,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10816 conditions, 2078 events. 1109/2078 cut-off events. For 8220/8795 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 13725 event pairs, 223 based on Foata normal form. 44/2108 useless extension candidates. Maximal degree in co-relation 10786. Up to 1096 conditions per place. [2022-12-05 23:05:18,256 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 106 transitions, 1209 flow [2022-12-05 23:05:18,256 INFO L188 LiptonReduction]: Number of co-enabled transitions 920 [2022-12-05 23:05:18,286 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:18,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 402 [2022-12-05 23:05:18,287 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 106 transitions, 1209 flow [2022-12-05 23:05:18,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 23:05:18,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:18,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:18,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:05:18,288 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 23:05:18,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:18,288 INFO L85 PathProgramCache]: Analyzing trace with hash -890352623, now seen corresponding path program 1 times [2022-12-05 23:05:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:18,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956891566] [2022-12-05 23:05:18,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:18,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:18,730 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 23:05:18,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:18,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956891566] [2022-12-05 23:05:18,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956891566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:18,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:18,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:05:18,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964052179] [2022-12-05 23:05:18,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:18,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:05:18,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:18,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:05:18,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:05:18,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 23:05:18,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 106 transitions, 1209 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 23:05:18,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:18,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 23:05:18,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:20,415 INFO L130 PetriNetUnfolder]: 10265/15094 cut-off events. [2022-12-05 23:05:20,415 INFO L131 PetriNetUnfolder]: For 75769/77260 co-relation queries the response was YES. [2022-12-05 23:05:20,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73845 conditions, 15094 events. 10265/15094 cut-off events. For 75769/77260 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 93276 event pairs, 3581 based on Foata normal form. 775/15650 useless extension candidates. Maximal degree in co-relation 73812. Up to 10340 conditions per place. [2022-12-05 23:05:20,522 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 91 selfloop transitions, 39 changer transitions 0/156 dead transitions. [2022-12-05 23:05:20,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 156 transitions, 1990 flow [2022-12-05 23:05:20,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:05:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:05:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-05 23:05:20,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2022-12-05 23:05:20,524 INFO L175 Difference]: Start difference. First operand has 67 places, 106 transitions, 1209 flow. Second operand 5 states and 64 transitions. [2022-12-05 23:05:20,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 156 transitions, 1990 flow [2022-12-05 23:05:20,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 156 transitions, 1980 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-05 23:05:20,620 INFO L231 Difference]: Finished difference. Result has 73 places, 131 transitions, 1676 flow [2022-12-05 23:05:20,620 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1676, PETRI_PLACES=73, PETRI_TRANSITIONS=131} [2022-12-05 23:05:20,622 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2022-12-05 23:05:20,622 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:20,622 INFO L89 Accepts]: Start accepts. Operand has 73 places, 131 transitions, 1676 flow [2022-12-05 23:05:20,624 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:20,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:20,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 131 transitions, 1676 flow [2022-12-05 23:05:20,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 131 transitions, 1676 flow [2022-12-05 23:05:20,851 INFO L130 PetriNetUnfolder]: 1422/2550 cut-off events. [2022-12-05 23:05:20,851 INFO L131 PetriNetUnfolder]: For 12841/13793 co-relation queries the response was YES. [2022-12-05 23:05:20,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14902 conditions, 2550 events. 1422/2550 cut-off events. For 12841/13793 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 16746 event pairs, 129 based on Foata normal form. 151/2680 useless extension candidates. Maximal degree in co-relation 14868. Up to 1452 conditions per place. [2022-12-05 23:05:20,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 131 transitions, 1676 flow [2022-12-05 23:05:20,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 1086 [2022-12-05 23:05:20,919 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:20,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 299 [2022-12-05 23:05:20,921 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 131 transitions, 1676 flow [2022-12-05 23:05:20,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 23:05:20,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:20,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:20,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:05:20,922 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 23:05:20,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:20,923 INFO L85 PathProgramCache]: Analyzing trace with hash 51778547, now seen corresponding path program 2 times [2022-12-05 23:05:20,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:20,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967798885] [2022-12-05 23:05:20,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:20,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:21,233 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 23:05:21,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:21,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967798885] [2022-12-05 23:05:21,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967798885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:21,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:21,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:05:21,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521998151] [2022-12-05 23:05:21,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:21,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:05:21,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:21,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:05:21,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:05:21,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 23:05:21,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 131 transitions, 1676 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 23:05:21,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:21,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 23:05:21,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:22,986 INFO L130 PetriNetUnfolder]: 10397/15339 cut-off events. [2022-12-05 23:05:22,986 INFO L131 PetriNetUnfolder]: For 96108/98008 co-relation queries the response was YES. [2022-12-05 23:05:23,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82168 conditions, 15339 events. 10397/15339 cut-off events. For 96108/98008 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 95113 event pairs, 1395 based on Foata normal form. 1165/16345 useless extension candidates. Maximal degree in co-relation 82131. Up to 9304 conditions per place. [2022-12-05 23:05:23,143 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 98 selfloop transitions, 61 changer transitions 0/185 dead transitions. [2022-12-05 23:05:23,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 185 transitions, 2557 flow [2022-12-05 23:05:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:05:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:05:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-05 23:05:23,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2022-12-05 23:05:23,146 INFO L175 Difference]: Start difference. First operand has 73 places, 131 transitions, 1676 flow. Second operand 6 states and 76 transitions. [2022-12-05 23:05:23,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 185 transitions, 2557 flow [2022-12-05 23:05:23,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 185 transitions, 2532 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-05 23:05:23,309 INFO L231 Difference]: Finished difference. Result has 78 places, 149 transitions, 2116 flow [2022-12-05 23:05:23,309 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2116, PETRI_PLACES=78, PETRI_TRANSITIONS=149} [2022-12-05 23:05:23,310 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2022-12-05 23:05:23,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:23,310 INFO L89 Accepts]: Start accepts. Operand has 78 places, 149 transitions, 2116 flow [2022-12-05 23:05:23,311 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:23,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:23,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 149 transitions, 2116 flow [2022-12-05 23:05:23,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 149 transitions, 2116 flow [2022-12-05 23:05:23,545 INFO L130 PetriNetUnfolder]: 1458/2636 cut-off events. [2022-12-05 23:05:23,545 INFO L131 PetriNetUnfolder]: For 15748/16663 co-relation queries the response was YES. [2022-12-05 23:05:23,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16553 conditions, 2636 events. 1458/2636 cut-off events. For 15748/16663 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 17568 event pairs, 121 based on Foata normal form. 168/2783 useless extension candidates. Maximal degree in co-relation 16517. Up to 1494 conditions per place. [2022-12-05 23:05:23,568 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 149 transitions, 2116 flow [2022-12-05 23:05:23,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-05 23:05:32,593 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:05:32,594 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9284 [2022-12-05 23:05:32,594 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 152 transitions, 2443 flow [2022-12-05 23:05:32,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 23:05:32,594 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:32,594 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:32,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:05:32,595 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 23:05:32,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:32,595 INFO L85 PathProgramCache]: Analyzing trace with hash -4851943, now seen corresponding path program 3 times [2022-12-05 23:05:32,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:32,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024835040] [2022-12-05 23:05:32,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:32,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:33,039 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 23:05:33,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:33,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024835040] [2022-12-05 23:05:33,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024835040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:33,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:33,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:05:33,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906395575] [2022-12-05 23:05:33,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:33,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:05:33,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:33,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:05:33,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:05:33,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2022-12-05 23:05:33,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 152 transitions, 2443 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 23:05:33,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:33,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2022-12-05 23:05:33,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:35,223 INFO L130 PetriNetUnfolder]: 11562/17541 cut-off events. [2022-12-05 23:05:35,224 INFO L131 PetriNetUnfolder]: For 134736/136960 co-relation queries the response was YES. [2022-12-05 23:05:35,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98789 conditions, 17541 events. 11562/17541 cut-off events. For 134736/136960 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 118236 event pairs, 2006 based on Foata normal form. 788/18027 useless extension candidates. Maximal degree in co-relation 98750. Up to 12220 conditions per place. [2022-12-05 23:05:35,359 INFO L137 encePairwiseOnDemand]: 43/49 looper letters, 100 selfloop transitions, 47 changer transitions 4/177 dead transitions. [2022-12-05 23:05:35,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 177 transitions, 2592 flow [2022-12-05 23:05:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:05:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:05:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-05 23:05:35,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30612244897959184 [2022-12-05 23:05:35,361 INFO L175 Difference]: Start difference. First operand has 79 places, 152 transitions, 2443 flow. Second operand 5 states and 75 transitions. [2022-12-05 23:05:35,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 177 transitions, 2592 flow [2022-12-05 23:05:35,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 177 transitions, 2557 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-05 23:05:35,629 INFO L231 Difference]: Finished difference. Result has 83 places, 142 transitions, 2122 flow [2022-12-05 23:05:35,629 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2122, PETRI_PLACES=83, PETRI_TRANSITIONS=142} [2022-12-05 23:05:35,630 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2022-12-05 23:05:35,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:35,630 INFO L89 Accepts]: Start accepts. Operand has 83 places, 142 transitions, 2122 flow [2022-12-05 23:05:35,632 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:35,632 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:35,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 142 transitions, 2122 flow [2022-12-05 23:05:35,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 142 transitions, 2122 flow [2022-12-05 23:05:35,867 INFO L130 PetriNetUnfolder]: 1293/2458 cut-off events. [2022-12-05 23:05:35,867 INFO L131 PetriNetUnfolder]: For 16382/16955 co-relation queries the response was YES. [2022-12-05 23:05:35,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15784 conditions, 2458 events. 1293/2458 cut-off events. For 16382/16955 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 17247 event pairs, 126 based on Foata normal form. 140/2580 useless extension candidates. Maximal degree in co-relation 15746. Up to 1338 conditions per place. [2022-12-05 23:05:35,888 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 142 transitions, 2122 flow [2022-12-05 23:05:35,888 INFO L188 LiptonReduction]: Number of co-enabled transitions 1144 [2022-12-05 23:05:35,908 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:35,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-05 23:05:35,909 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 142 transitions, 2122 flow [2022-12-05 23:05:35,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 23:05:35,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:35,909 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:35,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:05:35,910 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 23:05:35,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:35,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1664525719, now seen corresponding path program 1 times [2022-12-05 23:05:35,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:35,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731461849] [2022-12-05 23:05:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:36,210 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 23:05:36,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:36,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731461849] [2022-12-05 23:05:36,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731461849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:36,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:36,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:05:36,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611057221] [2022-12-05 23:05:36,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:36,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:05:36,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:36,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:05:36,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:05:36,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-05 23:05:36,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 142 transitions, 2122 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 23:05:36,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:36,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-05 23:05:36,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:37,824 INFO L130 PetriNetUnfolder]: 9433/14204 cut-off events. [2022-12-05 23:05:37,824 INFO L131 PetriNetUnfolder]: For 116395/118039 co-relation queries the response was YES. [2022-12-05 23:05:37,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81931 conditions, 14204 events. 9433/14204 cut-off events. For 116395/118039 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 90788 event pairs, 1409 based on Foata normal form. 1055/15115 useless extension candidates. Maximal degree in co-relation 81890. Up to 8165 conditions per place. [2022-12-05 23:05:37,964 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 81 selfloop transitions, 62 changer transitions 0/169 dead transitions. [2022-12-05 23:05:37,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 169 transitions, 2529 flow [2022-12-05 23:05:37,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:05:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:05:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-05 23:05:37,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42473118279569894 [2022-12-05 23:05:37,966 INFO L175 Difference]: Start difference. First operand has 82 places, 142 transitions, 2122 flow. Second operand 6 states and 79 transitions. [2022-12-05 23:05:37,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 169 transitions, 2529 flow [2022-12-05 23:05:38,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 169 transitions, 2517 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-05 23:05:38,120 INFO L231 Difference]: Finished difference. Result has 87 places, 138 transitions, 2136 flow [2022-12-05 23:05:38,120 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2136, PETRI_PLACES=87, PETRI_TRANSITIONS=138} [2022-12-05 23:05:38,121 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2022-12-05 23:05:38,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:38,121 INFO L89 Accepts]: Start accepts. Operand has 87 places, 138 transitions, 2136 flow [2022-12-05 23:05:38,123 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:38,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:38,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 138 transitions, 2136 flow [2022-12-05 23:05:38,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 138 transitions, 2136 flow [2022-12-05 23:05:38,339 INFO L130 PetriNetUnfolder]: 1216/2326 cut-off events. [2022-12-05 23:05:38,339 INFO L131 PetriNetUnfolder]: For 17225/17790 co-relation queries the response was YES. [2022-12-05 23:05:38,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15440 conditions, 2326 events. 1216/2326 cut-off events. For 17225/17790 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 16124 event pairs, 117 based on Foata normal form. 134/2442 useless extension candidates. Maximal degree in co-relation 15400. Up to 1252 conditions per place. [2022-12-05 23:05:38,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 138 transitions, 2136 flow [2022-12-05 23:05:38,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 1120 [2022-12-05 23:05:38,388 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:38,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-05 23:05:38,389 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 138 transitions, 2136 flow [2022-12-05 23:05:38,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 23:05:38,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:38,389 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:38,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:05:38,389 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 23:05:38,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:38,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2140287625, now seen corresponding path program 1 times [2022-12-05 23:05:38,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:38,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721745233] [2022-12-05 23:05:38,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:38,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:38,923 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 23:05:38,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:38,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721745233] [2022-12-05 23:05:38,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721745233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:38,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:38,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:05:38,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832435673] [2022-12-05 23:05:38,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:38,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:05:38,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:38,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:05:38,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:05:38,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:05:38,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 138 transitions, 2136 flow. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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 23:05:38,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:38,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:05:38,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:41,135 INFO L130 PetriNetUnfolder]: 15163/21812 cut-off events. [2022-12-05 23:05:41,135 INFO L131 PetriNetUnfolder]: For 160059/160059 co-relation queries the response was YES. [2022-12-05 23:05:41,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120996 conditions, 21812 events. 15163/21812 cut-off events. For 160059/160059 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 131899 event pairs, 3278 based on Foata normal form. 192/22004 useless extension candidates. Maximal degree in co-relation 120953. Up to 10519 conditions per place. [2022-12-05 23:05:41,272 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 151 selfloop transitions, 34 changer transitions 34/219 dead transitions. [2022-12-05 23:05:41,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 219 transitions, 3562 flow [2022-12-05 23:05:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:05:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:05:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-05 23:05:41,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-05 23:05:41,274 INFO L175 Difference]: Start difference. First operand has 87 places, 138 transitions, 2136 flow. Second operand 4 states and 68 transitions. [2022-12-05 23:05:41,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 219 transitions, 3562 flow [2022-12-05 23:05:41,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 219 transitions, 3355 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-12-05 23:05:41,570 INFO L231 Difference]: Finished difference. Result has 87 places, 128 transitions, 1972 flow [2022-12-05 23:05:41,570 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1977, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1972, PETRI_PLACES=87, PETRI_TRANSITIONS=128} [2022-12-05 23:05:41,571 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2022-12-05 23:05:41,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:41,571 INFO L89 Accepts]: Start accepts. Operand has 87 places, 128 transitions, 1972 flow [2022-12-05 23:05:41,572 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:41,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:41,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 128 transitions, 1972 flow [2022-12-05 23:05:41,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 128 transitions, 1972 flow [2022-12-05 23:05:41,892 INFO L130 PetriNetUnfolder]: 1103/2282 cut-off events. [2022-12-05 23:05:41,892 INFO L131 PetriNetUnfolder]: For 17049/17574 co-relation queries the response was YES. [2022-12-05 23:05:41,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15107 conditions, 2282 events. 1103/2282 cut-off events. For 17049/17574 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 16883 event pairs, 154 based on Foata normal form. 133/2399 useless extension candidates. Maximal degree in co-relation 15065. Up to 1304 conditions per place. [2022-12-05 23:05:41,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 128 transitions, 1972 flow [2022-12-05 23:05:41,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 1000 [2022-12-05 23:05:41,937 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:41,937 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 366 [2022-12-05 23:05:41,938 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 128 transitions, 1972 flow [2022-12-05 23:05:41,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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 23:05:41,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:41,938 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 23:05:41,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:05:41,938 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 23:05:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1866754806, now seen corresponding path program 1 times [2022-12-05 23:05:41,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:41,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850466451] [2022-12-05 23:05:41,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:41,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:42,383 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 23:05:42,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:42,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850466451] [2022-12-05 23:05:42,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850466451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:42,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:42,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:05:42,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272635588] [2022-12-05 23:05:42,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:42,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:05:42,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:42,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:05:42,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:05:42,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 23:05:42,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 128 transitions, 1972 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:42,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:42,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 23:05:42,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:44,317 INFO L130 PetriNetUnfolder]: 10881/16602 cut-off events. [2022-12-05 23:05:44,318 INFO L131 PetriNetUnfolder]: For 135466/137300 co-relation queries the response was YES. [2022-12-05 23:05:44,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93551 conditions, 16602 events. 10881/16602 cut-off events. For 135466/137300 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 111455 event pairs, 1787 based on Foata normal form. 587/16699 useless extension candidates. Maximal degree in co-relation 93506. Up to 9674 conditions per place. [2022-12-05 23:05:44,483 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 87 selfloop transitions, 59 changer transitions 1/171 dead transitions. [2022-12-05 23:05:44,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 171 transitions, 2730 flow [2022-12-05 23:05:44,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:05:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:05:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-05 23:05:44,485 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5615384615384615 [2022-12-05 23:05:44,485 INFO L175 Difference]: Start difference. First operand has 87 places, 128 transitions, 1972 flow. Second operand 5 states and 73 transitions. [2022-12-05 23:05:44,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 171 transitions, 2730 flow [2022-12-05 23:05:44,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 171 transitions, 2724 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-05 23:05:44,602 INFO L231 Difference]: Finished difference. Result has 92 places, 135 transitions, 2287 flow [2022-12-05 23:05:44,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2287, PETRI_PLACES=92, PETRI_TRANSITIONS=135} [2022-12-05 23:05:44,603 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2022-12-05 23:05:44,603 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:44,603 INFO L89 Accepts]: Start accepts. Operand has 92 places, 135 transitions, 2287 flow [2022-12-05 23:05:44,605 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:44,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:44,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 135 transitions, 2287 flow [2022-12-05 23:05:44,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 135 transitions, 2287 flow [2022-12-05 23:05:44,835 INFO L130 PetriNetUnfolder]: 1173/2467 cut-off events. [2022-12-05 23:05:44,835 INFO L131 PetriNetUnfolder]: For 21193/21721 co-relation queries the response was YES. [2022-12-05 23:05:44,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17361 conditions, 2467 events. 1173/2467 cut-off events. For 21193/21721 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 18881 event pairs, 172 based on Foata normal form. 128/2579 useless extension candidates. Maximal degree in co-relation 17316. Up to 1398 conditions per place. [2022-12-05 23:05:44,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 135 transitions, 2287 flow [2022-12-05 23:05:44,863 INFO L188 LiptonReduction]: Number of co-enabled transitions 1056 [2022-12-05 23:05:44,885 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:44,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 283 [2022-12-05 23:05:44,886 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 135 transitions, 2287 flow [2022-12-05 23:05:44,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:44,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:44,886 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 23:05:44,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:05:44,886 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 23:05:44,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:44,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1831186956, now seen corresponding path program 2 times [2022-12-05 23:05:44,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:44,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616431516] [2022-12-05 23:05:44,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:44,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:45,632 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 23:05:45,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:45,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616431516] [2022-12-05 23:05:45,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616431516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:45,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:45,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:05:45,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378966492] [2022-12-05 23:05:45,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:45,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:05:45,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:45,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:05:45,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:05:45,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 23:05:45,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 135 transitions, 2287 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:45,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:45,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 23:05:45,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:47,733 INFO L130 PetriNetUnfolder]: 11969/18280 cut-off events. [2022-12-05 23:05:47,733 INFO L131 PetriNetUnfolder]: For 173281/175133 co-relation queries the response was YES. [2022-12-05 23:05:47,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108074 conditions, 18280 events. 11969/18280 cut-off events. For 173281/175133 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 125942 event pairs, 2825 based on Foata normal form. 590/18314 useless extension candidates. Maximal degree in co-relation 108026. Up to 12554 conditions per place. [2022-12-05 23:05:47,846 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 118 selfloop transitions, 28 changer transitions 1/171 dead transitions. [2022-12-05 23:05:47,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 171 transitions, 2935 flow [2022-12-05 23:05:47,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:05:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:05:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-05 23:05:47,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2022-12-05 23:05:47,848 INFO L175 Difference]: Start difference. First operand has 92 places, 135 transitions, 2287 flow. Second operand 5 states and 72 transitions. [2022-12-05 23:05:47,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 171 transitions, 2935 flow [2022-12-05 23:05:48,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 171 transitions, 2847 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-05 23:05:48,026 INFO L231 Difference]: Finished difference. Result has 94 places, 138 transitions, 2338 flow [2022-12-05 23:05:48,026 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2207, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2338, PETRI_PLACES=94, PETRI_TRANSITIONS=138} [2022-12-05 23:05:48,026 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2022-12-05 23:05:48,026 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:48,027 INFO L89 Accepts]: Start accepts. Operand has 94 places, 138 transitions, 2338 flow [2022-12-05 23:05:48,028 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:48,028 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:48,028 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 138 transitions, 2338 flow [2022-12-05 23:05:48,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 138 transitions, 2338 flow [2022-12-05 23:05:48,268 INFO L130 PetriNetUnfolder]: 1250/2687 cut-off events. [2022-12-05 23:05:48,268 INFO L131 PetriNetUnfolder]: For 22794/23321 co-relation queries the response was YES. [2022-12-05 23:05:48,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18150 conditions, 2687 events. 1250/2687 cut-off events. For 22794/23321 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 21454 event pairs, 210 based on Foata normal form. 128/2799 useless extension candidates. Maximal degree in co-relation 18104. Up to 1501 conditions per place. [2022-12-05 23:05:48,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 138 transitions, 2338 flow [2022-12-05 23:05:48,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 1084 [2022-12-05 23:05:48,325 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:48,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 299 [2022-12-05 23:05:48,325 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 138 transitions, 2338 flow [2022-12-05 23:05:48,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:48,326 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:48,326 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 23:05:48,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 23:05:48,326 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:05:48,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:48,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1840356756, now seen corresponding path program 3 times [2022-12-05 23:05:48,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:48,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839059522] [2022-12-05 23:05:48,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:48,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:48,907 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 23:05:48,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:48,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839059522] [2022-12-05 23:05:48,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839059522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:48,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:48,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:05:48,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423924833] [2022-12-05 23:05:48,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:48,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:05:48,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:48,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:05:48,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:05:48,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 23:05:48,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 138 transitions, 2338 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:48,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:48,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 23:05:48,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:50,995 INFO L130 PetriNetUnfolder]: 11695/17860 cut-off events. [2022-12-05 23:05:50,995 INFO L131 PetriNetUnfolder]: For 168195/169891 co-relation queries the response was YES. [2022-12-05 23:05:51,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103925 conditions, 17860 events. 11695/17860 cut-off events. For 168195/169891 co-relation queries the response was YES. Maximal size of possible extension queue 1169. Compared 122414 event pairs, 2109 based on Foata normal form. 532/17778 useless extension candidates. Maximal degree in co-relation 103876. Up to 7379 conditions per place. [2022-12-05 23:05:51,214 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 101 selfloop transitions, 46 changer transitions 1/172 dead transitions. [2022-12-05 23:05:51,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 172 transitions, 2923 flow [2022-12-05 23:05:51,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:05:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:05:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-05 23:05:51,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5615384615384615 [2022-12-05 23:05:51,216 INFO L175 Difference]: Start difference. First operand has 94 places, 138 transitions, 2338 flow. Second operand 5 states and 73 transitions. [2022-12-05 23:05:51,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 172 transitions, 2923 flow [2022-12-05 23:05:51,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 172 transitions, 2876 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:05:51,410 INFO L231 Difference]: Finished difference. Result has 96 places, 137 transitions, 2400 flow [2022-12-05 23:05:51,411 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2291, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2400, PETRI_PLACES=96, PETRI_TRANSITIONS=137} [2022-12-05 23:05:51,411 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2022-12-05 23:05:51,411 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:51,411 INFO L89 Accepts]: Start accepts. Operand has 96 places, 137 transitions, 2400 flow [2022-12-05 23:05:51,412 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:51,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:51,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 137 transitions, 2400 flow [2022-12-05 23:05:51,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 137 transitions, 2400 flow [2022-12-05 23:05:51,663 INFO L130 PetriNetUnfolder]: 1226/2630 cut-off events. [2022-12-05 23:05:51,664 INFO L131 PetriNetUnfolder]: For 24102/24610 co-relation queries the response was YES. [2022-12-05 23:05:51,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18302 conditions, 2630 events. 1226/2630 cut-off events. For 24102/24610 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 20972 event pairs, 206 based on Foata normal form. 128/2742 useless extension candidates. Maximal degree in co-relation 18255. Up to 1468 conditions per place. [2022-12-05 23:05:51,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 137 transitions, 2400 flow [2022-12-05 23:05:51,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 1076 [2022-12-05 23:05:51,727 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:51,728 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 317 [2022-12-05 23:05:51,728 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 137 transitions, 2400 flow [2022-12-05 23:05:51,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:51,728 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:51,728 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 23:05:51,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 23:05:51,729 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:05:51,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:51,729 INFO L85 PathProgramCache]: Analyzing trace with hash 201191954, now seen corresponding path program 1 times [2022-12-05 23:05:51,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:51,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010003500] [2022-12-05 23:05:51,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:51,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:51,854 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 23:05:51,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:51,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010003500] [2022-12-05 23:05:51,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010003500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:51,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:51,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:05:51,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975118412] [2022-12-05 23:05:51,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:51,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:05:51,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:51,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:05:51,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:05:51,856 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-05 23:05:51,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 137 transitions, 2400 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 23:05:51,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:51,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-05 23:05:51,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:54,154 INFO L130 PetriNetUnfolder]: 10312/15789 cut-off events. [2022-12-05 23:05:54,154 INFO L131 PetriNetUnfolder]: For 230645/235014 co-relation queries the response was YES. [2022-12-05 23:05:54,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98377 conditions, 15789 events. 10312/15789 cut-off events. For 230645/235014 co-relation queries the response was YES. Maximal size of possible extension queue 1281. Compared 112369 event pairs, 1855 based on Foata normal form. 2740/17650 useless extension candidates. Maximal degree in co-relation 98327. Up to 9557 conditions per place. [2022-12-05 23:05:54,235 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 217 selfloop transitions, 9 changer transitions 90/346 dead transitions. [2022-12-05 23:05:54,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 346 transitions, 6900 flow [2022-12-05 23:05:54,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:05:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:05:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-05 23:05:54,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-05 23:05:54,239 INFO L175 Difference]: Start difference. First operand has 96 places, 137 transitions, 2400 flow. Second operand 5 states and 85 transitions. [2022-12-05 23:05:54,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 346 transitions, 6900 flow [2022-12-05 23:05:54,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 346 transitions, 6640 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-05 23:05:54,365 INFO L231 Difference]: Finished difference. Result has 99 places, 133 transitions, 2119 flow [2022-12-05 23:05:54,365 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2119, PETRI_PLACES=99, PETRI_TRANSITIONS=133} [2022-12-05 23:05:54,366 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places. [2022-12-05 23:05:54,366 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:54,366 INFO L89 Accepts]: Start accepts. Operand has 99 places, 133 transitions, 2119 flow [2022-12-05 23:05:54,367 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:54,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:54,367 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 133 transitions, 2119 flow [2022-12-05 23:05:54,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 133 transitions, 2119 flow [2022-12-05 23:05:54,948 INFO L130 PetriNetUnfolder]: 3500/6691 cut-off events. [2022-12-05 23:05:54,948 INFO L131 PetriNetUnfolder]: For 47371/50715 co-relation queries the response was YES. [2022-12-05 23:05:54,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34426 conditions, 6691 events. 3500/6691 cut-off events. For 47371/50715 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 59811 event pairs, 1251 based on Foata normal form. 257/6286 useless extension candidates. Maximal degree in co-relation 34376. Up to 3730 conditions per place. [2022-12-05 23:05:55,030 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 133 transitions, 2119 flow [2022-12-05 23:05:55,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 1854 [2022-12-05 23:05:55,037 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [501] L851-3-->L855: Formula: (and (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~main$tmp_guard0~0_76 (ite (= (ite (= v_~__unbuffered_cnt~0_129 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_53|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [458] L754-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-05 23:05:55,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [501] L851-3-->L855: Formula: (and (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~main$tmp_guard0~0_76 (ite (= (ite (= v_~__unbuffered_cnt~0_129 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_53|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [418] L791-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_32 1) v_~__unbuffered_cnt~0_31) (= |v_P2Thread1of1ForFork0_#res.offset_9| 0) (= |v_P2Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-05 23:05:55,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [501] L851-3-->L855: Formula: (and (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~main$tmp_guard0~0_76 (ite (= (ite (= v_~__unbuffered_cnt~0_129 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_53|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [461] L769-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P1Thread1of1ForFork3_#res.offset_7| 0) (= |v_P1Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-05 23:05:55,130 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:05:55,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 765 [2022-12-05 23:05:55,131 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 132 transitions, 2125 flow [2022-12-05 23:05:55,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 23:05:55,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:55,131 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:55,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 23:05:55,132 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:05:55,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:55,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1337121646, now seen corresponding path program 1 times [2022-12-05 23:05:55,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:55,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507016502] [2022-12-05 23:05:55,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:55,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:55,288 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 23:05:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:55,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507016502] [2022-12-05 23:05:55,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507016502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:55,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:55,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:05:55,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004647988] [2022-12-05 23:05:55,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:55,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:05:55,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:55,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:05:55,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:05:55,290 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-05 23:05:55,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 132 transitions, 2125 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 23:05:55,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:55,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-05 23:05:55,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:57,182 INFO L130 PetriNetUnfolder]: 7483/11918 cut-off events. [2022-12-05 23:05:57,182 INFO L131 PetriNetUnfolder]: For 180736/187363 co-relation queries the response was YES. [2022-12-05 23:05:57,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80320 conditions, 11918 events. 7483/11918 cut-off events. For 180736/187363 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 86852 event pairs, 478 based on Foata normal form. 2542/13846 useless extension candidates. Maximal degree in co-relation 80267. Up to 5293 conditions per place. [2022-12-05 23:05:57,260 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 295 selfloop transitions, 17 changer transitions 37/379 dead transitions. [2022-12-05 23:05:57,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 379 transitions, 7228 flow [2022-12-05 23:05:57,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:05:57,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:05:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-05 23:05:57,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6149425287356322 [2022-12-05 23:05:57,261 INFO L175 Difference]: Start difference. First operand has 98 places, 132 transitions, 2125 flow. Second operand 6 states and 107 transitions. [2022-12-05 23:05:57,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 379 transitions, 7228 flow [2022-12-05 23:05:57,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 379 transitions, 7187 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-05 23:05:57,414 INFO L231 Difference]: Finished difference. Result has 104 places, 137 transitions, 2156 flow [2022-12-05 23:05:57,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2156, PETRI_PLACES=104, PETRI_TRANSITIONS=137} [2022-12-05 23:05:57,415 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 60 predicate places. [2022-12-05 23:05:57,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:57,415 INFO L89 Accepts]: Start accepts. Operand has 104 places, 137 transitions, 2156 flow [2022-12-05 23:05:57,417 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:57,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:57,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 137 transitions, 2156 flow [2022-12-05 23:05:57,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 137 transitions, 2156 flow [2022-12-05 23:05:57,856 INFO L130 PetriNetUnfolder]: 2239/4910 cut-off events. [2022-12-05 23:05:57,856 INFO L131 PetriNetUnfolder]: For 44343/54129 co-relation queries the response was YES. [2022-12-05 23:05:57,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28424 conditions, 4910 events. 2239/4910 cut-off events. For 44343/54129 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 46957 event pairs, 308 based on Foata normal form. 307/4796 useless extension candidates. Maximal degree in co-relation 28371. Up to 3444 conditions per place. [2022-12-05 23:05:58,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 137 transitions, 2156 flow [2022-12-05 23:05:58,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 2232 [2022-12-05 23:05:58,024 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:58,025 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 610 [2022-12-05 23:05:58,025 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 137 transitions, 2156 flow [2022-12-05 23:05:58,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 23:05:58,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:58,026 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] [2022-12-05 23:05:58,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 23:05:58,026 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:05:58,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash -281379477, now seen corresponding path program 1 times [2022-12-05 23:05:58,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:58,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081115826] [2022-12-05 23:05:58,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:58,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:58,215 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 23:05:58,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:58,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081115826] [2022-12-05 23:05:58,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081115826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:58,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:58,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:05:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948653677] [2022-12-05 23:05:58,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:58,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:05:58,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:58,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:05:58,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:05:58,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-05 23:05:58,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 137 transitions, 2156 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 23:05:58,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:58,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-05 23:05:58,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:59,948 INFO L130 PetriNetUnfolder]: 6835/10940 cut-off events. [2022-12-05 23:05:59,948 INFO L131 PetriNetUnfolder]: For 163811/171399 co-relation queries the response was YES. [2022-12-05 23:05:59,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80292 conditions, 10940 events. 6835/10940 cut-off events. For 163811/171399 co-relation queries the response was YES. Maximal size of possible extension queue 968. Compared 80114 event pairs, 227 based on Foata normal form. 2532/12896 useless extension candidates. Maximal degree in co-relation 80236. Up to 5055 conditions per place. [2022-12-05 23:06:00,011 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 232 selfloop transitions, 25 changer transitions 127/409 dead transitions. [2022-12-05 23:06:00,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 409 transitions, 7795 flow [2022-12-05 23:06:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 23:06:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 23:06:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2022-12-05 23:06:00,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2022-12-05 23:06:00,012 INFO L175 Difference]: Start difference. First operand has 104 places, 137 transitions, 2156 flow. Second operand 8 states and 140 transitions. [2022-12-05 23:06:00,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 409 transitions, 7795 flow [2022-12-05 23:06:00,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 409 transitions, 7571 flow, removed 19 selfloop flow, removed 9 redundant places. [2022-12-05 23:06:00,738 INFO L231 Difference]: Finished difference. Result has 105 places, 123 transitions, 1812 flow [2022-12-05 23:06:00,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1812, PETRI_PLACES=105, PETRI_TRANSITIONS=123} [2022-12-05 23:06:00,738 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 61 predicate places. [2022-12-05 23:06:00,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:00,738 INFO L89 Accepts]: Start accepts. Operand has 105 places, 123 transitions, 1812 flow [2022-12-05 23:06:00,740 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:00,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:00,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 123 transitions, 1812 flow [2022-12-05 23:06:00,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 123 transitions, 1812 flow [2022-12-05 23:06:01,015 INFO L130 PetriNetUnfolder]: 1451/3721 cut-off events. [2022-12-05 23:06:01,015 INFO L131 PetriNetUnfolder]: For 30248/34115 co-relation queries the response was YES. [2022-12-05 23:06:01,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20609 conditions, 3721 events. 1451/3721 cut-off events. For 30248/34115 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 38049 event pairs, 62 based on Foata normal form. 179/3599 useless extension candidates. Maximal degree in co-relation 20557. Up to 1744 conditions per place. [2022-12-05 23:06:01,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 123 transitions, 1812 flow [2022-12-05 23:06:01,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 2116 [2022-12-05 23:06:01,626 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:06:01,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 889 [2022-12-05 23:06:01,627 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 118 transitions, 1761 flow [2022-12-05 23:06:01,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 23:06:01,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:01,627 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 23:06:01,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 23:06:01,627 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:01,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:01,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1216420161, now seen corresponding path program 1 times [2022-12-05 23:06:01,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:01,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094842688] [2022-12-05 23:06:01,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:01,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:01,750 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 23:06:01,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:01,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094842688] [2022-12-05 23:06:01,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094842688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:01,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:01,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:06:01,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275151262] [2022-12-05 23:06:01,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:01,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:06:01,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:01,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:06:01,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:06:01,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-05 23:06:01,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 118 transitions, 1761 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 23:06:01,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:01,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-05 23:06:01,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:02,873 INFO L130 PetriNetUnfolder]: 4532/8105 cut-off events. [2022-12-05 23:06:02,874 INFO L131 PetriNetUnfolder]: For 98391/98800 co-relation queries the response was YES. [2022-12-05 23:06:02,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57997 conditions, 8105 events. 4532/8105 cut-off events. For 98391/98800 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 62506 event pairs, 499 based on Foata normal form. 282/8325 useless extension candidates. Maximal degree in co-relation 57942. Up to 3760 conditions per place. [2022-12-05 23:06:02,935 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 117 selfloop transitions, 1 changer transitions 88/225 dead transitions. [2022-12-05 23:06:02,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 225 transitions, 3702 flow [2022-12-05 23:06:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:06:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:06:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-05 23:06:02,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-05 23:06:02,937 INFO L175 Difference]: Start difference. First operand has 105 places, 118 transitions, 1761 flow. Second operand 4 states and 69 transitions. [2022-12-05 23:06:02,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 225 transitions, 3702 flow [2022-12-05 23:06:03,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 225 transitions, 3392 flow, removed 82 selfloop flow, removed 9 redundant places. [2022-12-05 23:06:03,338 INFO L231 Difference]: Finished difference. Result has 101 places, 94 transitions, 1262 flow [2022-12-05 23:06:03,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1262, PETRI_PLACES=101, PETRI_TRANSITIONS=94} [2022-12-05 23:06:03,339 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2022-12-05 23:06:03,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:03,339 INFO L89 Accepts]: Start accepts. Operand has 101 places, 94 transitions, 1262 flow [2022-12-05 23:06:03,340 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:03,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:03,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 94 transitions, 1262 flow [2022-12-05 23:06:03,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 94 transitions, 1262 flow [2022-12-05 23:06:03,476 INFO L130 PetriNetUnfolder]: 579/1472 cut-off events. [2022-12-05 23:06:03,476 INFO L131 PetriNetUnfolder]: For 7530/7694 co-relation queries the response was YES. [2022-12-05 23:06:03,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7262 conditions, 1472 events. 579/1472 cut-off events. For 7530/7694 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 11644 event pairs, 42 based on Foata normal form. 42/1448 useless extension candidates. Maximal degree in co-relation 7214. Up to 514 conditions per place. [2022-12-05 23:06:03,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 94 transitions, 1262 flow [2022-12-05 23:06:03,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 856 [2022-12-05 23:06:03,619 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:06:03,620 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 281 [2022-12-05 23:06:03,620 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 93 transitions, 1278 flow [2022-12-05 23:06:03,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 23:06:03,620 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:03,620 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 23:06:03,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-05 23:06:03,620 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:03,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:03,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1215316952, now seen corresponding path program 1 times [2022-12-05 23:06:03,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:03,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239255415] [2022-12-05 23:06:03,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:03,775 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 23:06:03,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:03,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239255415] [2022-12-05 23:06:03,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239255415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:03,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:03,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:06:03,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586024132] [2022-12-05 23:06:03,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:03,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:06:03,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:03,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:06:03,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:06:03,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-05 23:06:03,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 93 transitions, 1278 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 23:06:03,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:03,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-05 23:06:03,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:04,368 INFO L130 PetriNetUnfolder]: 1392/2610 cut-off events. [2022-12-05 23:06:04,368 INFO L131 PetriNetUnfolder]: For 29821/29996 co-relation queries the response was YES. [2022-12-05 23:06:04,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16675 conditions, 2610 events. 1392/2610 cut-off events. For 29821/29996 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 17519 event pairs, 63 based on Foata normal form. 156/2733 useless extension candidates. Maximal degree in co-relation 16627. Up to 921 conditions per place. [2022-12-05 23:06:04,383 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 53 selfloop transitions, 17 changer transitions 144/219 dead transitions. [2022-12-05 23:06:04,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 219 transitions, 3680 flow [2022-12-05 23:06:04,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 23:06:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 23:06:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-05 23:06:04,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4879032258064516 [2022-12-05 23:06:04,385 INFO L175 Difference]: Start difference. First operand has 94 places, 93 transitions, 1278 flow. Second operand 8 states and 121 transitions. [2022-12-05 23:06:04,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 219 transitions, 3680 flow [2022-12-05 23:06:04,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 219 transitions, 3510 flow, removed 40 selfloop flow, removed 6 redundant places. [2022-12-05 23:06:04,445 INFO L231 Difference]: Finished difference. Result has 98 places, 46 transitions, 485 flow [2022-12-05 23:06:04,445 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=485, PETRI_PLACES=98, PETRI_TRANSITIONS=46} [2022-12-05 23:06:04,446 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2022-12-05 23:06:04,446 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:04,446 INFO L89 Accepts]: Start accepts. Operand has 98 places, 46 transitions, 485 flow [2022-12-05 23:06:04,447 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:04,447 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:04,447 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 46 transitions, 485 flow [2022-12-05 23:06:04,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 46 transitions, 485 flow [2022-12-05 23:06:04,457 INFO L130 PetriNetUnfolder]: 42/117 cut-off events. [2022-12-05 23:06:04,457 INFO L131 PetriNetUnfolder]: For 400/417 co-relation queries the response was YES. [2022-12-05 23:06:04,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 117 events. 42/117 cut-off events. For 400/417 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 383 event pairs, 1 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 571. Up to 40 conditions per place. [2022-12-05 23:06:04,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 46 transitions, 485 flow [2022-12-05 23:06:04,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-05 23:06:04,509 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L781-->L784: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [381] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd4~0_14 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_21 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse5 .cse2)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3))) (and (= v_~z~0_61 (ite .cse0 v_~z$w_buff0~0_38 (ite .cse1 v_~z$w_buff1~0_33 v_~z~0_62))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_20 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3)) 0 v_~z$r_buff1_thd4~0_14) v_~z$r_buff1_thd4~0_13) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94)) (= v_~z$r_buff0_thd4~0_20 (ite .cse4 0 v_~z$r_buff0_thd4~0_21)) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_38, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_33, ~z~0=v_~z~0_62} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_13, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_38, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_33, ~z~0=v_~z~0_61} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] [2022-12-05 23:06:04,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L754: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~b~0_36 1) (= v_~x~0_165 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~b~0=v_~b~0_36, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_165, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [491] $Ultimate##0-->L766: Formula: (and (= v_~x~0_57 2) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_57} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-05 23:06:05,884 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L781-->L827: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_602 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd4~0_100 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_149 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_603 256) 0)))) (.cse0 (and (not (= 0 (mod v_~z$w_buff1_used~0_558 256))) .cse4)) (.cse1 (and .cse5 .cse3))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_558) v_~z$w_buff1_used~0_557) (= (ite .cse2 0 v_~z$w_buff0_used~0_603) v_~z$w_buff0_used~0_602) (= v_~z~0_528 (ite .cse2 v_~z$w_buff0~0_416 (ite .cse0 v_~z$w_buff1~0_371 1))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_148 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_557 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_100) v_~z$r_buff1_thd4~0_99) (= v_~z$r_buff0_thd4~0_148 (ite .cse1 0 v_~z$r_buff0_thd4~0_149))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_100, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_603, ~z$w_buff0~0=v_~z$w_buff0~0_416, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_149, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_558, ~z$w_buff1~0=v_~z$w_buff1~0_371} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_99, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_602, ~z$w_buff0~0=v_~z$w_buff0~0_416, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_148, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_557, ~z$w_buff1~0=v_~z$w_buff1~0_371, ~z~0=v_~z~0_528} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [371] L784-->L791: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_90 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd3~0_19 (ite .cse1 0 v_~z$r_buff0_thd3~0_20)) (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_36 (ite .cse2 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_19 256) 0)))) 0 v_~z$r_buff1_thd3~0_18) v_~z$r_buff1_thd3~0_17)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-05 23:06:06,022 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-05 23:06:06,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1577 [2022-12-05 23:06:06,023 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 39 transitions, 471 flow [2022-12-05 23:06:06,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 23:06:06,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:06,023 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 23:06:06,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-05 23:06:06,024 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:06,024 INFO L85 PathProgramCache]: Analyzing trace with hash -755970173, now seen corresponding path program 1 times [2022-12-05 23:06:06,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:06,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035215599] [2022-12-05 23:06:06,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:06,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:06:06,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:06:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:06:06,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:06:06,100 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:06:06,101 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 23:06:06,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 23:06:06,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 23:06:06,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 23:06:06,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 23:06:06,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 23:06:06,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 23:06:06,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-05 23:06:06,104 INFO L458 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:06,109 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:06:06,109 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:06:06,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:06:06 BasicIcfg [2022-12-05 23:06:06,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:06:06,184 INFO L158 Benchmark]: Toolchain (without parser) took 69103.35ms. Allocated memory was 190.8MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 166.2MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-05 23:06:06,184 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory was 168.0MB in the beginning and 167.9MB in the end (delta: 82.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:06:06,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.25ms. Allocated memory is still 190.8MB. Free memory was 165.7MB in the beginning and 138.3MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-05 23:06:06,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.38ms. Allocated memory is still 190.8MB. Free memory was 138.3MB in the beginning and 135.3MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:06:06,185 INFO L158 Benchmark]: Boogie Preprocessor took 49.63ms. Allocated memory is still 190.8MB. Free memory was 135.3MB in the beginning and 133.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:06:06,185 INFO L158 Benchmark]: RCFGBuilder took 675.51ms. Allocated memory is still 190.8MB. Free memory was 133.2MB in the beginning and 100.7MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-05 23:06:06,186 INFO L158 Benchmark]: TraceAbstraction took 67797.44ms. Allocated memory was 190.8MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 99.7MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-05 23:06:06,187 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.11ms. Allocated memory is still 190.8MB. Free memory was 168.0MB in the beginning and 167.9MB in the end (delta: 82.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 494.25ms. Allocated memory is still 190.8MB. Free memory was 165.7MB in the beginning and 138.3MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 79.38ms. Allocated memory is still 190.8MB. Free memory was 138.3MB in the beginning and 135.3MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.63ms. Allocated memory is still 190.8MB. Free memory was 135.3MB in the beginning and 133.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 675.51ms. Allocated memory is still 190.8MB. Free memory was 133.2MB in the beginning and 100.7MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 67797.44ms. Allocated memory was 190.8MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 99.7MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 136 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 32 TransitionsAfterwards, 2936 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2265, independent: 2202, independent conditional: 2202, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2265, independent: 2202, independent conditional: 0, independent unconditional: 2202, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2265, independent: 2202, independent conditional: 0, independent unconditional: 2202, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2265, independent: 2202, independent conditional: 0, independent unconditional: 2202, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1857, independent: 1811, independent conditional: 0, independent unconditional: 1811, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1857, independent: 1782, independent conditional: 0, independent unconditional: 1782, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 258, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2265, independent: 391, independent conditional: 0, independent unconditional: 391, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1857, unknown conditional: 0, unknown unconditional: 1857] , Statistics on independence cache: Total cache size (in pairs): 2730, Positive cache size: 2684, Positive conditional cache size: 0, Positive unconditional cache size: 2684, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, 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.3s, 38 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 425, independent: 372, independent conditional: 372, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 425, independent: 372, independent conditional: 23, independent unconditional: 349, dependent: 53, dependent conditional: 6, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 425, independent: 372, independent conditional: 23, independent unconditional: 349, dependent: 53, dependent conditional: 6, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 425, independent: 372, independent conditional: 23, independent unconditional: 349, dependent: 53, dependent conditional: 6, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 201, independent: 180, independent conditional: 11, independent unconditional: 169, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 201, independent: 173, independent conditional: 0, independent unconditional: 173, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 75, dependent conditional: 31, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 425, independent: 192, independent conditional: 12, independent unconditional: 180, dependent: 32, dependent conditional: 4, dependent unconditional: 28, unknown: 201, unknown conditional: 13, unknown unconditional: 188] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 180, Positive conditional cache size: 11, Positive unconditional cache size: 169, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, 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, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 90, independent conditional: 15, independent unconditional: 75, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 90, independent conditional: 6, independent unconditional: 84, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 90, independent conditional: 6, independent unconditional: 84, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 100, independent: 82, independent conditional: 6, independent unconditional: 76, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 188, Positive conditional cache size: 11, Positive unconditional cache size: 177, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 476 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 337, independent: 314, independent conditional: 314, 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: 337, independent: 314, independent conditional: 85, independent unconditional: 229, dependent: 23, dependent conditional: 5, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 338, independent: 314, independent conditional: 23, independent unconditional: 291, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 338, independent: 314, independent conditional: 23, independent unconditional: 291, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 338, independent: 310, independent conditional: 21, independent unconditional: 289, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 192, Positive conditional cache size: 13, Positive unconditional cache size: 179, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 62, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 377, independent: 352, independent conditional: 352, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 377, independent: 352, independent conditional: 113, independent unconditional: 239, dependent: 25, dependent conditional: 1, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 378, independent: 352, independent conditional: 24, independent unconditional: 328, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 378, independent: 352, independent conditional: 24, independent unconditional: 328, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 378, independent: 350, independent conditional: 23, independent unconditional: 327, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 194, Positive conditional cache size: 14, Positive unconditional cache size: 180, Negative cache size: 26, Negative conditional cache size: 5, 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: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 534, independent: 495, independent conditional: 495, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 534, independent: 495, independent conditional: 186, independent unconditional: 309, dependent: 39, dependent conditional: 1, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 535, independent: 495, independent conditional: 26, independent unconditional: 469, dependent: 40, dependent conditional: 2, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 535, independent: 495, independent conditional: 26, independent unconditional: 469, dependent: 40, dependent conditional: 2, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 535, independent: 495, independent conditional: 26, independent unconditional: 469, dependent: 40, dependent conditional: 2, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 194, Positive conditional cache size: 14, Positive unconditional cache size: 180, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 160, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 854 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 906, independent: 856, independent conditional: 856, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 906, independent: 856, independent conditional: 492, independent unconditional: 364, dependent: 50, dependent conditional: 11, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 907, independent: 856, independent conditional: 125, independent unconditional: 731, dependent: 51, dependent conditional: 2, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 907, independent: 856, independent conditional: 125, independent unconditional: 731, dependent: 51, dependent conditional: 2, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 3, independent unconditional: 3, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 907, independent: 850, independent conditional: 122, independent unconditional: 728, dependent: 51, dependent conditional: 2, dependent unconditional: 49, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 200, Positive conditional cache size: 17, Positive unconditional cache size: 183, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 377, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 106 TransitionsBefore, 106 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 767, independent: 710, independent conditional: 710, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 767, independent: 710, independent conditional: 349, independent unconditional: 361, dependent: 57, dependent conditional: 1, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 768, independent: 710, independent conditional: 95, independent unconditional: 615, dependent: 58, dependent conditional: 2, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 768, independent: 710, independent conditional: 95, independent unconditional: 615, dependent: 58, dependent conditional: 2, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 768, independent: 708, independent conditional: 93, independent unconditional: 615, dependent: 58, dependent conditional: 2, dependent unconditional: 56, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 202, Positive conditional cache size: 19, Positive unconditional cache size: 183, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 254, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 1086 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1085, independent: 1020, independent conditional: 1020, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1085, independent: 1020, independent conditional: 647, independent unconditional: 373, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1085, independent: 1020, independent conditional: 225, independent unconditional: 795, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1085, independent: 1020, independent conditional: 225, independent unconditional: 795, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 1085, independent: 1018, independent conditional: 224, independent unconditional: 794, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 204, Positive conditional cache size: 20, Positive unconditional cache size: 184, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 422, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 78 PlacesBefore, 79 PlacesAfterwards, 149 TransitionsBefore, 152 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3077, independent: 2910, independent conditional: 2910, independent unconditional: 0, dependent: 167, dependent conditional: 167, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3077, independent: 2910, independent conditional: 1859, independent unconditional: 1051, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3077, independent: 2910, independent conditional: 773, independent unconditional: 2137, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3077, independent: 2910, independent conditional: 773, independent unconditional: 2137, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 3077, independent: 2909, independent conditional: 772, independent unconditional: 2137, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 297, Positive conditional cache size: 21, Positive unconditional cache size: 276, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1086, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 142 TransitionsBefore, 142 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1399, independent: 1327, independent conditional: 1327, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1399, independent: 1327, independent conditional: 757, independent unconditional: 570, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1399, independent: 1327, independent conditional: 204, independent unconditional: 1123, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1399, independent: 1327, independent conditional: 204, independent unconditional: 1123, dependent: 72, dependent conditional: 0, dependent unconditional: 72, 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: 1399, independent: 1324, independent conditional: 201, independent unconditional: 1123, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 300, Positive conditional cache size: 24, Positive unconditional cache size: 276, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 553, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 1120 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1328, independent: 1258, independent conditional: 1258, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1328, independent: 1258, independent conditional: 672, independent unconditional: 586, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1328, independent: 1258, independent conditional: 155, independent unconditional: 1103, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1328, independent: 1258, independent conditional: 155, independent unconditional: 1103, dependent: 70, dependent conditional: 0, dependent unconditional: 70, 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: 1328, independent: 1258, independent conditional: 155, independent unconditional: 1103, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 300, Positive conditional cache size: 24, Positive unconditional cache size: 276, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 517, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 128 TransitionsBefore, 128 TransitionsAfterwards, 1000 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 887, independent: 829, independent conditional: 829, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 887, independent: 829, independent conditional: 385, independent unconditional: 444, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 887, independent: 829, independent conditional: 89, independent unconditional: 740, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 887, independent: 829, independent conditional: 89, independent unconditional: 740, dependent: 58, dependent conditional: 0, dependent unconditional: 58, 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: 887, independent: 829, independent conditional: 89, independent unconditional: 740, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 300, Positive conditional cache size: 24, Positive unconditional cache size: 276, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 296, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 135 TransitionsBefore, 135 TransitionsAfterwards, 1056 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1136, independent: 1070, independent conditional: 1070, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1136, independent: 1070, independent conditional: 556, independent unconditional: 514, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1136, independent: 1070, independent conditional: 81, independent unconditional: 989, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1136, independent: 1070, independent conditional: 81, independent unconditional: 989, dependent: 66, dependent conditional: 0, dependent unconditional: 66, 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: 1136, independent: 1069, independent conditional: 81, independent unconditional: 988, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 301, Positive conditional cache size: 24, Positive unconditional cache size: 277, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 475, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 1084 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1158, independent: 1095, independent conditional: 1095, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1158, independent: 1095, independent conditional: 617, independent unconditional: 478, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1158, independent: 1095, independent conditional: 90, independent unconditional: 1005, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1158, independent: 1095, independent conditional: 90, independent unconditional: 1005, dependent: 63, dependent conditional: 0, dependent unconditional: 63, 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: 1158, independent: 1095, independent conditional: 90, independent unconditional: 1005, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 301, Positive conditional cache size: 24, Positive unconditional cache size: 277, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 527, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 96 PlacesBefore, 96 PlacesAfterwards, 137 TransitionsBefore, 137 TransitionsAfterwards, 1076 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1114, independent: 1052, independent conditional: 1052, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1114, independent: 1052, independent conditional: 580, independent unconditional: 472, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1114, independent: 1052, independent conditional: 89, independent unconditional: 963, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1114, independent: 1052, independent conditional: 89, independent unconditional: 963, dependent: 62, dependent conditional: 0, dependent unconditional: 62, 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: 1114, independent: 1052, independent conditional: 89, independent unconditional: 963, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 301, Positive conditional cache size: 24, Positive unconditional cache size: 277, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 491, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 99 PlacesBefore, 98 PlacesAfterwards, 133 TransitionsBefore, 132 TransitionsAfterwards, 1854 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 733, independent: 719, independent conditional: 719, 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: 733, independent: 719, independent conditional: 565, independent unconditional: 154, 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: 733, independent: 719, independent conditional: 340, independent unconditional: 379, 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: 733, independent: 719, independent conditional: 340, independent unconditional: 379, 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: 8, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 733, independent: 711, independent conditional: 335, independent unconditional: 376, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 8, unknown conditional: 5, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 327, Positive conditional cache size: 29, Positive unconditional cache size: 298, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 225, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 104 PlacesBefore, 104 PlacesAfterwards, 137 TransitionsBefore, 137 TransitionsAfterwards, 2232 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 203, independent: 196, independent conditional: 196, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 203, independent: 196, independent conditional: 133, independent unconditional: 63, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 203, independent: 196, independent conditional: 70, independent unconditional: 126, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203, independent: 196, independent conditional: 70, independent unconditional: 126, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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: 203, independent: 196, independent conditional: 70, independent unconditional: 126, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 327, Positive conditional cache size: 29, Positive unconditional cache size: 298, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 63, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 105 PlacesBefore, 105 PlacesAfterwards, 123 TransitionsBefore, 118 TransitionsAfterwards, 2116 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 818, independent: 797, independent conditional: 797, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 818, independent: 797, independent conditional: 650, independent unconditional: 147, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 818, independent: 797, independent conditional: 415, independent unconditional: 382, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 818, independent: 797, independent conditional: 415, independent unconditional: 382, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 20, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 818, independent: 776, independent conditional: 395, independent unconditional: 381, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 21, unknown conditional: 20, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 374, Positive cache size: 348, Positive conditional cache size: 49, Positive unconditional cache size: 299, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 235, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 95 PlacesBefore, 94 PlacesAfterwards, 94 TransitionsBefore, 93 TransitionsAfterwards, 856 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 385, independent: 385, independent conditional: 385, 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: 385, independent: 385, independent conditional: 308, independent unconditional: 77, 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: 385, independent: 385, independent conditional: 168, independent unconditional: 217, 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: 385, independent: 385, independent conditional: 168, independent unconditional: 217, 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: 385, independent: 385, independent conditional: 168, independent unconditional: 217, 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): 710, Positive cache size: 684, Positive conditional cache size: 70, Positive unconditional cache size: 614, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 140, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 91 PlacesBefore, 83 PlacesAfterwards, 46 TransitionsBefore, 39 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 0, independent unconditional: 34, 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: 34, independent: 34, independent conditional: 0, independent unconditional: 34, 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: 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] , 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: 34, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 927, Positive cache size: 901, Positive conditional cache size: 75, Positive unconditional cache size: 826, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 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; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1253, ((void *)0), P0, ((void *)0))=-2, t1253={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] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1254, ((void *)0), P1, ((void *)0))=-1, t1253={5:0}, t1254={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] [L848] 0 pthread_t t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1255, ((void *)0), P2, ((void *)0))=0, t1253={5:0}, t1254={6:0}, t1255={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] [L850] 0 pthread_t t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1256, ((void *)0), P3, ((void *)0))=1, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={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] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 [L753] 1 x = 1 [L765] 1 x = 2 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L822] 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) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 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 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __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}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 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 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 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 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L879] 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_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}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 847]: 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: 851]: 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: 849]: 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, 165 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: 67.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 36.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 699 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 699 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1870 IncrementalHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 54 mSDtfsCounter, 1870 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2443occurred in iteration=9, InterpolantAutomatonStates: 100, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 3033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 23:06:06,223 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...