/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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 04:25:56,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 04:25:56,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 04:25:56,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 04:25:56,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 04:25:56,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 04:25:56,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 04:25:56,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 04:25:56,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 04:25:56,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 04:25:56,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 04:25:56,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 04:25:56,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 04:25:56,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 04:25:56,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 04:25:56,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 04:25:56,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 04:25:56,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 04:25:56,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 04:25:56,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 04:25:56,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 04:25:56,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 04:25:56,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 04:25:56,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 04:25:56,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 04:25:56,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 04:25:56,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 04:25:56,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 04:25:56,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 04:25:56,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 04:25:56,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 04:25:56,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 04:25:56,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 04:25:56,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 04:25:56,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 04:25:56,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 04:25:56,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 04:25:56,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 04:25:56,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 04:25:56,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 04:25:56,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 04:25:56,284 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 04:25:56,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 04:25:56,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 04:25:56,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 04:25:56,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 04:25:56,311 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 04:25:56,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 04:25:56,312 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 04:25:56,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 04:25:56,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 04:25:56,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 04:25:56,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 04:25:56,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 04:25:56,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 04:25:56,313 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 04:25:56,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 04:25:56,313 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 04:25:56,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 04:25:56,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 04:25:56,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 04:25:56,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 04:25:56,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 04:25:56,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:25:56,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 04:25:56,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 04:25:56,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 04:25:56,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 04:25:56,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 04:25:56,315 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 04:25:56,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 04:25:56,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 04:25:56,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 04:25:56,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 04:25:56,605 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 04:25:56,606 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 04:25:56,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2022-12-13 04:25:57,654 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 04:25:57,832 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 04:25:57,832 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2022-12-13 04:25:57,843 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3fb814b/a8561206727346cf90f02fb99d9a8d13/FLAG426ffc53b [2022-12-13 04:25:57,856 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3fb814b/a8561206727346cf90f02fb99d9a8d13 [2022-12-13 04:25:57,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 04:25:57,860 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 04:25:57,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 04:25:57,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 04:25:57,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 04:25:57,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:25:57" (1/1) ... [2022-12-13 04:25:57,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fd28b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:57, skipping insertion in model container [2022-12-13 04:25:57,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:25:57" (1/1) ... [2022-12-13 04:25:57,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 04:25:57,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 04:25:57,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:57,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:57,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,022 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c[4400,4413] [2022-12-13 04:25:58,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:25:58,038 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 04:25:58,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:58,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:58,087 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c[4400,4413] [2022-12-13 04:25:58,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:25:58,101 INFO L208 MainTranslator]: Completed translation [2022-12-13 04:25:58,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:58 WrapperNode [2022-12-13 04:25:58,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 04:25:58,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 04:25:58,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 04:25:58,103 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 04:25:58,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:58" (1/1) ... [2022-12-13 04:25:58,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:58" (1/1) ... [2022-12-13 04:25:58,162 INFO L138 Inliner]: procedures = 25, calls = 100, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 278 [2022-12-13 04:25:58,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 04:25:58,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 04:25:58,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 04:25:58,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 04:25:58,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:58" (1/1) ... [2022-12-13 04:25:58,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:58" (1/1) ... [2022-12-13 04:25:58,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:58" (1/1) ... [2022-12-13 04:25:58,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:58" (1/1) ... [2022-12-13 04:25:58,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:58" (1/1) ... [2022-12-13 04:25:58,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:58" (1/1) ... [2022-12-13 04:25:58,194 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:58" (1/1) ... [2022-12-13 04:25:58,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:58" (1/1) ... [2022-12-13 04:25:58,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 04:25:58,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 04:25:58,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 04:25:58,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 04:25:58,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:58" (1/1) ... [2022-12-13 04:25:58,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:25:58,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:25:58,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 04:25:58,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 04:25:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 04:25:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 04:25:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 04:25:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 04:25:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 04:25:58,265 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 04:25:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 04:25:58,266 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 04:25:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 04:25:58,266 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 04:25:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 04:25:58,266 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 04:25:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 04:25:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-13 04:25:58,266 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-13 04:25:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-13 04:25:58,266 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-13 04:25:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 04:25:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 04:25:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 04:25:58,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 04:25:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 04:25:58,267 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 04:25:58,344 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 04:25:58,346 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 04:25:58,590 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 04:25:58,671 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 04:25:58,672 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 04:25:58,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:25:58 BoogieIcfgContainer [2022-12-13 04:25:58,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 04:25:58,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 04:25:58,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 04:25:58,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 04:25:58,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:25:57" (1/3) ... [2022-12-13 04:25:58,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0252c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:25:58, skipping insertion in model container [2022-12-13 04:25:58,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:58" (2/3) ... [2022-12-13 04:25:58,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0252c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:25:58, skipping insertion in model container [2022-12-13 04:25:58,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:25:58" (3/3) ... [2022-12-13 04:25:58,680 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-6.wvr.c [2022-12-13 04:25:58,702 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 04:25:58,702 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 04:25:58,703 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 04:25:58,794 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-12-13 04:25:58,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 181 transitions, 410 flow [2022-12-13 04:25:58,889 INFO L130 PetriNetUnfolder]: 2/175 cut-off events. [2022-12-13 04:25:58,889 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 04:25:58,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 175 events. 2/175 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-13 04:25:58,898 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 181 transitions, 410 flow [2022-12-13 04:25:58,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 159 transitions, 354 flow [2022-12-13 04:25:58,916 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:25:58,942 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 159 transitions, 354 flow [2022-12-13 04:25:58,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 159 transitions, 354 flow [2022-12-13 04:25:58,990 INFO L130 PetriNetUnfolder]: 2/159 cut-off events. [2022-12-13 04:25:58,991 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 04:25:58,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 159 events. 2/159 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-13 04:25:58,996 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 159 transitions, 354 flow [2022-12-13 04:25:58,996 INFO L226 LiptonReduction]: Number of co-enabled transitions 3042 [2022-12-13 04:26:05,470 INFO L241 LiptonReduction]: Total number of compositions: 121 [2022-12-13 04:26:05,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 04:26:05,486 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;@70822297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 04:26:05,486 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 04:26:05,501 INFO L130 PetriNetUnfolder]: 0/37 cut-off events. [2022-12-13 04:26:05,501 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 04:26:05,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:05,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:05,502 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:05,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash -152965531, now seen corresponding path program 1 times [2022-12-13 04:26:05,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:05,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208012363] [2022-12-13 04:26:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:05,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:06,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:06,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208012363] [2022-12-13 04:26:06,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208012363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:06,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:06,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:26:06,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650065745] [2022-12-13 04:26:06,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:06,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:26:06,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:07,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:26:07,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:26:07,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:26:07,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 112 flow. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:07,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:07,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:26:07,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:08,928 INFO L130 PetriNetUnfolder]: 18703/24423 cut-off events. [2022-12-13 04:26:08,929 INFO L131 PetriNetUnfolder]: For 1753/1753 co-relation queries the response was YES. [2022-12-13 04:26:09,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50812 conditions, 24423 events. 18703/24423 cut-off events. For 1753/1753 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 112611 event pairs, 9560 based on Foata normal form. 1/24424 useless extension candidates. Maximal degree in co-relation 49901. Up to 16400 conditions per place. [2022-12-13 04:26:09,155 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 76 selfloop transitions, 19 changer transitions 24/119 dead transitions. [2022-12-13 04:26:09,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 119 transitions, 557 flow [2022-12-13 04:26:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:26:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:26:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2022-12-13 04:26:09,181 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45112781954887216 [2022-12-13 04:26:09,184 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2022-12-13 04:26:09,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 119 transitions, 557 flow [2022-12-13 04:26:09,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 95 transitions, 440 flow [2022-12-13 04:26:09,405 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:09,406 INFO L89 Accepts]: Start accepts. Operand has 62 places, 95 transitions, 440 flow [2022-12-13 04:26:09,410 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:09,410 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:09,410 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 95 transitions, 440 flow [2022-12-13 04:26:09,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 95 transitions, 440 flow [2022-12-13 04:26:09,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:09,572 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:26:09,573 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-13 04:26:09,573 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 95 transitions, 440 flow [2022-12-13 04:26:09,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:09,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:09,574 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:09,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 04:26:09,574 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:09,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash -99509331, now seen corresponding path program 2 times [2022-12-13 04:26:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:09,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730987086] [2022-12-13 04:26:09,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:09,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:10,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:10,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730987086] [2022-12-13 04:26:10,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730987086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:10,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:10,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:26:10,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946642116] [2022-12-13 04:26:10,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:10,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:26:10,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:10,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:26:10,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:26:10,260 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:10,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 95 transitions, 440 flow. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:10,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:10,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:10,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:12,820 INFO L130 PetriNetUnfolder]: 27488/36209 cut-off events. [2022-12-13 04:26:12,821 INFO L131 PetriNetUnfolder]: For 3097/3097 co-relation queries the response was YES. [2022-12-13 04:26:12,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111706 conditions, 36209 events. 27488/36209 cut-off events. For 3097/3097 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 185419 event pairs, 5106 based on Foata normal form. 2/36211 useless extension candidates. Maximal degree in co-relation 109726. Up to 31555 conditions per place. [2022-12-13 04:26:12,968 INFO L137 encePairwiseOnDemand]: 23/39 looper letters, 158 selfloop transitions, 37 changer transitions 24/219 dead transitions. [2022-12-13 04:26:12,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 219 transitions, 1473 flow [2022-12-13 04:26:12,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:26:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:26:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2022-12-13 04:26:12,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-13 04:26:12,975 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2022-12-13 04:26:12,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 219 transitions, 1473 flow [2022-12-13 04:26:13,056 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 195 transitions, 1293 flow [2022-12-13 04:26:13,210 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:13,210 INFO L89 Accepts]: Start accepts. Operand has 69 places, 195 transitions, 1293 flow [2022-12-13 04:26:13,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:13,215 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:13,215 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 195 transitions, 1293 flow [2022-12-13 04:26:13,224 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 195 transitions, 1293 flow [2022-12-13 04:26:13,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:13,632 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:26:13,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 423 [2022-12-13 04:26:13,633 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 195 transitions, 1297 flow [2022-12-13 04:26:13,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:13,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:13,634 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:13,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 04:26:13,634 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:13,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:13,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1010834503, now seen corresponding path program 3 times [2022-12-13 04:26:13,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:13,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941557401] [2022-12-13 04:26:13,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:13,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:13,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:13,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941557401] [2022-12-13 04:26:13,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941557401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:13,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:13,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:26:13,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56477228] [2022-12-13 04:26:13,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:13,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:26:13,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:13,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:26:13,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:26:13,965 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:26:13,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 195 transitions, 1297 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:13,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:13,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:26:13,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:15,471 INFO L130 PetriNetUnfolder]: 17318/23007 cut-off events. [2022-12-13 04:26:15,472 INFO L131 PetriNetUnfolder]: For 1306/1306 co-relation queries the response was YES. [2022-12-13 04:26:15,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93838 conditions, 23007 events. 17318/23007 cut-off events. For 1306/1306 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 115017 event pairs, 2256 based on Foata normal form. 124/23131 useless extension candidates. Maximal degree in co-relation 92698. Up to 22153 conditions per place. [2022-12-13 04:26:15,595 INFO L137 encePairwiseOnDemand]: 28/40 looper letters, 174 selfloop transitions, 21 changer transitions 44/239 dead transitions. [2022-12-13 04:26:15,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 239 transitions, 2062 flow [2022-12-13 04:26:15,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:26:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:26:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-13 04:26:15,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.465 [2022-12-13 04:26:15,597 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2022-12-13 04:26:15,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 239 transitions, 2062 flow [2022-12-13 04:26:15,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 195 transitions, 1686 flow [2022-12-13 04:26:15,816 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:15,817 INFO L89 Accepts]: Start accepts. Operand has 73 places, 195 transitions, 1686 flow [2022-12-13 04:26:15,819 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:15,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:15,819 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 195 transitions, 1686 flow [2022-12-13 04:26:15,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 195 transitions, 1686 flow [2022-12-13 04:26:15,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:15,952 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:26:15,953 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 04:26:15,953 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 195 transitions, 1690 flow [2022-12-13 04:26:15,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:15,953 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:15,954 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:15,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 04:26:15,954 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:15,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1373679249, now seen corresponding path program 4 times [2022-12-13 04:26:15,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:15,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112685637] [2022-12-13 04:26:15,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:15,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:16,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:16,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112685637] [2022-12-13 04:26:16,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112685637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:16,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:16,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:26:16,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671112842] [2022-12-13 04:26:16,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:16,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:26:16,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:16,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:26:16,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:26:16,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:16,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 195 transitions, 1690 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:16,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:16,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:16,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:17,239 INFO L130 PetriNetUnfolder]: 11358/15239 cut-off events. [2022-12-13 04:26:17,240 INFO L131 PetriNetUnfolder]: For 954/954 co-relation queries the response was YES. [2022-12-13 04:26:17,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77362 conditions, 15239 events. 11358/15239 cut-off events. For 954/954 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 72842 event pairs, 1638 based on Foata normal form. 120/15359 useless extension candidates. Maximal degree in co-relation 76682. Up to 14447 conditions per place. [2022-12-13 04:26:17,346 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 208 selfloop transitions, 31 changer transitions 0/239 dead transitions. [2022-12-13 04:26:17,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 239 transitions, 2543 flow [2022-12-13 04:26:17,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:26:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:26:17,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-13 04:26:17,347 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4153846153846154 [2022-12-13 04:26:17,347 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2022-12-13 04:26:17,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 239 transitions, 2543 flow [2022-12-13 04:26:17,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 239 transitions, 2543 flow [2022-12-13 04:26:17,506 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:17,506 INFO L89 Accepts]: Start accepts. Operand has 77 places, 239 transitions, 2543 flow [2022-12-13 04:26:17,508 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:17,508 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:17,508 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 239 transitions, 2543 flow [2022-12-13 04:26:17,510 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 239 transitions, 2543 flow [2022-12-13 04:26:17,510 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:17,614 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:26:17,623 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 04:26:17,623 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 239 transitions, 2549 flow [2022-12-13 04:26:17,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:17,623 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:17,623 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:17,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 04:26:17,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:17,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:17,624 INFO L85 PathProgramCache]: Analyzing trace with hash 149813913, now seen corresponding path program 5 times [2022-12-13 04:26:17,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:17,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70009648] [2022-12-13 04:26:17,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:17,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:17,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:17,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70009648] [2022-12-13 04:26:17,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70009648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:17,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:17,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:26:17,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782765614] [2022-12-13 04:26:17,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:17,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:26:17,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:17,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:26:17,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:26:17,791 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:17,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 239 transitions, 2549 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:17,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:17,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:17,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:18,836 INFO L130 PetriNetUnfolder]: 9642/13007 cut-off events. [2022-12-13 04:26:18,836 INFO L131 PetriNetUnfolder]: For 780/780 co-relation queries the response was YES. [2022-12-13 04:26:18,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78978 conditions, 13007 events. 9642/13007 cut-off events. For 780/780 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 60626 event pairs, 1450 based on Foata normal form. 112/13119 useless extension candidates. Maximal degree in co-relation 78259. Up to 12245 conditions per place. [2022-12-13 04:26:18,933 INFO L137 encePairwiseOnDemand]: 32/39 looper letters, 262 selfloop transitions, 43 changer transitions 0/305 dead transitions. [2022-12-13 04:26:18,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 305 transitions, 3852 flow [2022-12-13 04:26:18,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:26:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:26:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-13 04:26:18,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-13 04:26:18,935 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2022-12-13 04:26:18,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 305 transitions, 3852 flow [2022-12-13 04:26:19,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 305 transitions, 3852 flow [2022-12-13 04:26:19,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:19,082 INFO L89 Accepts]: Start accepts. Operand has 81 places, 305 transitions, 3852 flow [2022-12-13 04:26:19,084 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:19,084 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:19,084 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 305 transitions, 3852 flow [2022-12-13 04:26:19,087 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 305 transitions, 3852 flow [2022-12-13 04:26:19,087 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:19,160 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:26:19,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-13 04:26:19,161 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 305 transitions, 3860 flow [2022-12-13 04:26:19,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:19,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:19,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:19,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 04:26:19,162 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:19,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:19,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1848497679, now seen corresponding path program 6 times [2022-12-13 04:26:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:19,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108369531] [2022-12-13 04:26:19,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:19,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:19,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108369531] [2022-12-13 04:26:19,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108369531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:19,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:19,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:26:19,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577035059] [2022-12-13 04:26:19,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:19,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:26:19,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:19,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:26:19,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:26:19,348 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:19,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 305 transitions, 3860 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:19,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:19,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:19,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:20,444 INFO L130 PetriNetUnfolder]: 8118/11031 cut-off events. [2022-12-13 04:26:20,444 INFO L131 PetriNetUnfolder]: For 618/618 co-relation queries the response was YES. [2022-12-13 04:26:20,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77998 conditions, 11031 events. 8118/11031 cut-off events. For 618/618 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 50547 event pairs, 1052 based on Foata normal form. 96/11127 useless extension candidates. Maximal degree in co-relation 77168. Up to 10283 conditions per place. [2022-12-13 04:26:20,525 INFO L137 encePairwiseOnDemand]: 34/39 looper letters, 334 selfloop transitions, 51 changer transitions 0/385 dead transitions. [2022-12-13 04:26:20,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 385 transitions, 5624 flow [2022-12-13 04:26:20,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:26:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:26:20,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-13 04:26:20,527 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3641025641025641 [2022-12-13 04:26:20,527 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 28 predicate places. [2022-12-13 04:26:20,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 385 transitions, 5624 flow [2022-12-13 04:26:20,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 385 transitions, 5624 flow [2022-12-13 04:26:20,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:20,673 INFO L89 Accepts]: Start accepts. Operand has 85 places, 385 transitions, 5624 flow [2022-12-13 04:26:20,676 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:20,676 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:20,676 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 385 transitions, 5624 flow [2022-12-13 04:26:20,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 385 transitions, 5624 flow [2022-12-13 04:26:20,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:20,745 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:26:20,746 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-13 04:26:20,746 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 385 transitions, 5634 flow [2022-12-13 04:26:20,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:20,746 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:20,746 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:20,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 04:26:20,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:20,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:20,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2044351487, now seen corresponding path program 7 times [2022-12-13 04:26:20,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:20,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303878183] [2022-12-13 04:26:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:20,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:20,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:20,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303878183] [2022-12-13 04:26:20,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303878183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:20,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:20,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:26:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599040156] [2022-12-13 04:26:20,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:20,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:26:20,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:20,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:26:20,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:26:20,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:20,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 385 transitions, 5634 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:20,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:20,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:20,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:22,086 INFO L130 PetriNetUnfolder]: 6452/8805 cut-off events. [2022-12-13 04:26:22,086 INFO L131 PetriNetUnfolder]: For 440/440 co-relation queries the response was YES. [2022-12-13 04:26:22,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71174 conditions, 8805 events. 6452/8805 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 38555 event pairs, 380 based on Foata normal form. 64/8869 useless extension candidates. Maximal degree in co-relation 70266. Up to 8063 conditions per place. [2022-12-13 04:26:22,128 INFO L137 encePairwiseOnDemand]: 34/39 looper letters, 76 selfloop transitions, 2 changer transitions 351/429 dead transitions. [2022-12-13 04:26:22,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 429 transitions, 7098 flow [2022-12-13 04:26:22,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:26:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:26:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-13 04:26:22,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3384615384615385 [2022-12-13 04:26:22,129 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2022-12-13 04:26:22,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 429 transitions, 7098 flow [2022-12-13 04:26:22,165 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 78 transitions, 1296 flow [2022-12-13 04:26:22,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:22,197 INFO L89 Accepts]: Start accepts. Operand has 77 places, 78 transitions, 1296 flow [2022-12-13 04:26:22,199 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:22,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:22,199 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 78 transitions, 1296 flow [2022-12-13 04:26:22,200 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 78 transitions, 1296 flow [2022-12-13 04:26:22,200 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:22,301 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:26:22,302 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 04:26:22,302 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 1296 flow [2022-12-13 04:26:22,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:22,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:22,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:22,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 04:26:22,303 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:22,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:22,303 INFO L85 PathProgramCache]: Analyzing trace with hash -274421045, now seen corresponding path program 8 times [2022-12-13 04:26:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:22,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639219280] [2022-12-13 04:26:22,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:22,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:22,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639219280] [2022-12-13 04:26:22,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639219280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:22,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:22,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:26:22,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080655621] [2022-12-13 04:26:22,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:22,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:26:22,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:22,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:26:22,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:26:22,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:22,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 1296 flow. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:22,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:22,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:22,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:23,548 INFO L130 PetriNetUnfolder]: 7189/9766 cut-off events. [2022-12-13 04:26:23,549 INFO L131 PetriNetUnfolder]: For 435/435 co-relation queries the response was YES. [2022-12-13 04:26:23,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88619 conditions, 9766 events. 7189/9766 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 45498 event pairs, 310 based on Foata normal form. 596/10362 useless extension candidates. Maximal degree in co-relation 88392. Up to 9754 conditions per place. [2022-12-13 04:26:23,618 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 134 selfloop transitions, 60 changer transitions 0/194 dead transitions. [2022-12-13 04:26:23,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 194 transitions, 3573 flow [2022-12-13 04:26:23,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:26:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:26:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 146 transitions. [2022-12-13 04:26:23,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31196581196581197 [2022-12-13 04:26:23,620 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2022-12-13 04:26:23,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 194 transitions, 3573 flow [2022-12-13 04:26:23,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 194 transitions, 3573 flow [2022-12-13 04:26:23,726 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:23,726 INFO L89 Accepts]: Start accepts. Operand has 88 places, 194 transitions, 3573 flow [2022-12-13 04:26:23,728 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:23,728 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:23,728 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 194 transitions, 3573 flow [2022-12-13 04:26:23,730 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 194 transitions, 3573 flow [2022-12-13 04:26:23,730 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:23,736 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:23,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 04:26:23,737 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 194 transitions, 3573 flow [2022-12-13 04:26:23,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:23,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:23,737 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:23,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 04:26:23,738 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:23,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:23,738 INFO L85 PathProgramCache]: Analyzing trace with hash 531371555, now seen corresponding path program 1 times [2022-12-13 04:26:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:23,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775228280] [2022-12-13 04:26:23,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:23,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:24,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:24,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775228280] [2022-12-13 04:26:24,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775228280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:24,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:24,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:26:24,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658208759] [2022-12-13 04:26:24,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:24,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:26:24,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:24,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:26:24,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:26:24,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:24,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 194 transitions, 3573 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:24,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:24,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:24,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:24,802 INFO L130 PetriNetUnfolder]: 6406/8775 cut-off events. [2022-12-13 04:26:24,802 INFO L131 PetriNetUnfolder]: For 398/398 co-relation queries the response was YES. [2022-12-13 04:26:24,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88406 conditions, 8775 events. 6406/8775 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 40846 event pairs, 624 based on Foata normal form. 92/8867 useless extension candidates. Maximal degree in co-relation 88156. Up to 8763 conditions per place. [2022-12-13 04:26:24,861 INFO L137 encePairwiseOnDemand]: 32/39 looper letters, 195 selfloop transitions, 39 changer transitions 0/234 dead transitions. [2022-12-13 04:26:24,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 234 transitions, 4776 flow [2022-12-13 04:26:24,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:26:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:26:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-13 04:26:24,863 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3230769230769231 [2022-12-13 04:26:24,863 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 35 predicate places. [2022-12-13 04:26:24,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 234 transitions, 4776 flow [2022-12-13 04:26:24,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 234 transitions, 4776 flow [2022-12-13 04:26:24,950 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:24,950 INFO L89 Accepts]: Start accepts. Operand has 92 places, 234 transitions, 4776 flow [2022-12-13 04:26:24,952 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:24,952 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:24,953 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 234 transitions, 4776 flow [2022-12-13 04:26:24,955 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 234 transitions, 4776 flow [2022-12-13 04:26:24,955 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:24,960 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:24,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 04:26:24,962 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 234 transitions, 4776 flow [2022-12-13 04:26:24,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:24,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:24,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:24,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 04:26:24,962 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:24,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:24,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1783332175, now seen corresponding path program 2 times [2022-12-13 04:26:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:24,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063269125] [2022-12-13 04:26:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:25,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:25,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063269125] [2022-12-13 04:26:25,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063269125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:25,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:25,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:26:25,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377256304] [2022-12-13 04:26:25,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:25,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:26:25,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:25,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:26:25,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:26:25,182 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:25,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 234 transitions, 4776 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:25,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:25,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:25,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:27,301 INFO L130 PetriNetUnfolder]: 12901/18170 cut-off events. [2022-12-13 04:26:27,301 INFO L131 PetriNetUnfolder]: For 1097/1097 co-relation queries the response was YES. [2022-12-13 04:26:27,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201180 conditions, 18170 events. 12901/18170 cut-off events. For 1097/1097 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 100927 event pairs, 108 based on Foata normal form. 558/18728 useless extension candidates. Maximal degree in co-relation 200726. Up to 18158 conditions per place. [2022-12-13 04:26:27,460 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 266 selfloop transitions, 230 changer transitions 5/501 dead transitions. [2022-12-13 04:26:27,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 501 transitions, 11229 flow [2022-12-13 04:26:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:26:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:26:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2022-12-13 04:26:27,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2022-12-13 04:26:27,463 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 44 predicate places. [2022-12-13 04:26:27,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 501 transitions, 11229 flow [2022-12-13 04:26:27,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 496 transitions, 11119 flow [2022-12-13 04:26:27,691 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:27,691 INFO L89 Accepts]: Start accepts. Operand has 101 places, 496 transitions, 11119 flow [2022-12-13 04:26:27,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:27,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:27,696 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 496 transitions, 11119 flow [2022-12-13 04:26:27,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 496 transitions, 11119 flow [2022-12-13 04:26:27,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:27,710 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:27,711 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 04:26:27,711 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 496 transitions, 11119 flow [2022-12-13 04:26:27,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:27,711 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:27,711 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:27,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 04:26:27,712 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:27,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:27,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1771436111, now seen corresponding path program 3 times [2022-12-13 04:26:27,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:27,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084096137] [2022-12-13 04:26:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:27,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:27,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084096137] [2022-12-13 04:26:27,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084096137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:27,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:27,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:26:27,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467772109] [2022-12-13 04:26:27,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:27,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:26:27,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:27,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:26:27,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:26:27,912 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:27,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 496 transitions, 11119 flow. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:27,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:27,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:27,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:30,391 INFO L130 PetriNetUnfolder]: 13255/18704 cut-off events. [2022-12-13 04:26:30,391 INFO L131 PetriNetUnfolder]: For 1141/1141 co-relation queries the response was YES. [2022-12-13 04:26:30,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225755 conditions, 18704 events. 13255/18704 cut-off events. For 1141/1141 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 104739 event pairs, 142 based on Foata normal form. 264/18968 useless extension candidates. Maximal degree in co-relation 225262. Up to 18692 conditions per place. [2022-12-13 04:26:30,520 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 529 selfloop transitions, 124 changer transitions 0/653 dead transitions. [2022-12-13 04:26:30,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 653 transitions, 15879 flow [2022-12-13 04:26:30,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:26:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:26:30,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-12-13 04:26:30,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2792022792022792 [2022-12-13 04:26:30,522 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 52 predicate places. [2022-12-13 04:26:30,522 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 653 transitions, 15879 flow [2022-12-13 04:26:30,766 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 653 transitions, 15879 flow [2022-12-13 04:26:30,846 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:30,846 INFO L89 Accepts]: Start accepts. Operand has 109 places, 653 transitions, 15879 flow [2022-12-13 04:26:30,851 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:30,851 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:30,851 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 653 transitions, 15879 flow [2022-12-13 04:26:30,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 653 transitions, 15879 flow [2022-12-13 04:26:30,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:30,868 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:30,868 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 04:26:30,868 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 653 transitions, 15879 flow [2022-12-13 04:26:30,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:30,869 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:30,869 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:30,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 04:26:30,869 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:30,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash 615439361, now seen corresponding path program 4 times [2022-12-13 04:26:30,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:30,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927870050] [2022-12-13 04:26:30,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:30,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:31,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:31,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927870050] [2022-12-13 04:26:31,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927870050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:31,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:31,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:26:31,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838198432] [2022-12-13 04:26:31,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:31,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:26:31,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:31,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:26:31,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:26:31,011 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:31,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 653 transitions, 15879 flow. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:31,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:31,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:31,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:33,781 INFO L130 PetriNetUnfolder]: 13844/19639 cut-off events. [2022-12-13 04:26:33,781 INFO L131 PetriNetUnfolder]: For 1175/1175 co-relation queries the response was YES. [2022-12-13 04:26:33,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256705 conditions, 19639 events. 13844/19639 cut-off events. For 1175/1175 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 112404 event pairs, 130 based on Foata normal form. 486/20125 useless extension candidates. Maximal degree in co-relation 256173. Up to 19627 conditions per place. [2022-12-13 04:26:34,079 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 713 selfloop transitions, 156 changer transitions 0/869 dead transitions. [2022-12-13 04:26:34,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 869 transitions, 22846 flow [2022-12-13 04:26:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:26:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:26:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-12-13 04:26:34,081 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2948717948717949 [2022-12-13 04:26:34,083 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 59 predicate places. [2022-12-13 04:26:34,083 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 869 transitions, 22846 flow [2022-12-13 04:26:34,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 869 transitions, 22846 flow [2022-12-13 04:26:34,437 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:34,437 INFO L89 Accepts]: Start accepts. Operand has 116 places, 869 transitions, 22846 flow [2022-12-13 04:26:34,444 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:34,444 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:34,444 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 869 transitions, 22846 flow [2022-12-13 04:26:34,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 869 transitions, 22846 flow [2022-12-13 04:26:34,462 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:34,490 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:34,490 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 04:26:34,491 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 869 transitions, 22846 flow [2022-12-13 04:26:34,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:34,491 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:34,491 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:34,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 04:26:34,491 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:34,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:34,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1199044825, now seen corresponding path program 5 times [2022-12-13 04:26:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:34,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723220677] [2022-12-13 04:26:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:34,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:34,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723220677] [2022-12-13 04:26:34,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723220677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:34,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:34,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:26:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453087113] [2022-12-13 04:26:34,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:34,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:26:34,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:34,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:26:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:26:34,775 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:34,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 869 transitions, 22846 flow. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:34,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:34,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:34,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:39,466 INFO L130 PetriNetUnfolder]: 17340/25195 cut-off events. [2022-12-13 04:26:39,466 INFO L131 PetriNetUnfolder]: For 2011/2011 co-relation queries the response was YES. [2022-12-13 04:26:39,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354653 conditions, 25195 events. 17340/25195 cut-off events. For 2011/2011 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 157085 event pairs, 192 based on Foata normal form. 686/25881 useless extension candidates. Maximal degree in co-relation 353796. Up to 25183 conditions per place. [2022-12-13 04:26:39,619 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 723 selfloop transitions, 536 changer transitions 9/1268 dead transitions. [2022-12-13 04:26:39,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 1268 transitions, 35882 flow [2022-12-13 04:26:39,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:26:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:26:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 173 transitions. [2022-12-13 04:26:39,620 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3696581196581197 [2022-12-13 04:26:39,620 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 70 predicate places. [2022-12-13 04:26:39,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 1268 transitions, 35882 flow [2022-12-13 04:26:39,840 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 1259 transitions, 35630 flow [2022-12-13 04:26:39,966 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:39,967 INFO L89 Accepts]: Start accepts. Operand has 127 places, 1259 transitions, 35630 flow [2022-12-13 04:26:39,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:39,975 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:39,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 1259 transitions, 35630 flow [2022-12-13 04:26:39,990 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 1259 transitions, 35630 flow [2022-12-13 04:26:39,990 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:40,004 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:40,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 04:26:40,005 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 1259 transitions, 35630 flow [2022-12-13 04:26:40,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:40,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:40,005 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:40,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 04:26:40,005 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:40,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:40,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1907359573, now seen corresponding path program 6 times [2022-12-13 04:26:40,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:40,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89169402] [2022-12-13 04:26:40,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:40,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:40,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:40,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89169402] [2022-12-13 04:26:40,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89169402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:40,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:40,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:26:40,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592646849] [2022-12-13 04:26:40,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:40,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:26:40,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:40,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:26:40,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:26:40,147 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:40,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 1259 transitions, 35630 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:40,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:40,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:40,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:43,968 INFO L130 PetriNetUnfolder]: 12660/18623 cut-off events. [2022-12-13 04:26:43,968 INFO L131 PetriNetUnfolder]: For 1563/1563 co-relation queries the response was YES. [2022-12-13 04:26:44,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280782 conditions, 18623 events. 12660/18623 cut-off events. For 1563/1563 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 115240 event pairs, 108 based on Foata normal form. 180/18803 useless extension candidates. Maximal degree in co-relation 279866. Up to 18611 conditions per place. [2022-12-13 04:26:44,204 INFO L137 encePairwiseOnDemand]: 34/39 looper letters, 1145 selfloop transitions, 113 changer transitions 0/1258 dead transitions. [2022-12-13 04:26:44,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 1258 transitions, 38139 flow [2022-12-13 04:26:44,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:26:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:26:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-13 04:26:44,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29743589743589743 [2022-12-13 04:26:44,206 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 74 predicate places. [2022-12-13 04:26:44,206 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 1258 transitions, 38139 flow [2022-12-13 04:26:44,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 1258 transitions, 38139 flow [2022-12-13 04:26:44,407 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:44,408 INFO L89 Accepts]: Start accepts. Operand has 131 places, 1258 transitions, 38139 flow [2022-12-13 04:26:44,417 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:44,417 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:44,417 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 1258 transitions, 38139 flow [2022-12-13 04:26:44,431 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 1258 transitions, 38139 flow [2022-12-13 04:26:44,432 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:44,438 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:44,439 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 04:26:44,439 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 1258 transitions, 38139 flow [2022-12-13 04:26:44,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:44,439 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:44,439 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:44,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 04:26:44,439 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:44,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash 146408087, now seen corresponding path program 7 times [2022-12-13 04:26:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:44,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075063522] [2022-12-13 04:26:44,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:44,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:44,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075063522] [2022-12-13 04:26:44,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075063522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:44,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:44,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:26:44,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20331788] [2022-12-13 04:26:44,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:44,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:26:44,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:44,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:26:44,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:26:44,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:44,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 1258 transitions, 38139 flow. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:44,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:44,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:44,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:50,131 INFO L130 PetriNetUnfolder]: 16155/23826 cut-off events. [2022-12-13 04:26:50,131 INFO L131 PetriNetUnfolder]: For 1912/1912 co-relation queries the response was YES. [2022-12-13 04:26:50,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383080 conditions, 23826 events. 16155/23826 cut-off events. For 1912/1912 co-relation queries the response was YES. Maximal size of possible extension queue 1296. Compared 153639 event pairs, 240 based on Foata normal form. 278/24104 useless extension candidates. Maximal degree in co-relation 382040. Up to 23814 conditions per place. [2022-12-13 04:26:50,295 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 1205 selfloop transitions, 468 changer transitions 0/1673 dead transitions. [2022-12-13 04:26:50,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 1673 transitions, 54079 flow [2022-12-13 04:26:50,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:26:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:26:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2022-12-13 04:26:50,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2022-12-13 04:26:50,296 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 81 predicate places. [2022-12-13 04:26:50,296 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 1673 transitions, 54079 flow [2022-12-13 04:26:50,448 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 1673 transitions, 54079 flow [2022-12-13 04:26:50,578 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:50,578 INFO L89 Accepts]: Start accepts. Operand has 138 places, 1673 transitions, 54079 flow [2022-12-13 04:26:50,591 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:50,591 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:50,591 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 1673 transitions, 54079 flow [2022-12-13 04:26:50,614 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 1673 transitions, 54079 flow [2022-12-13 04:26:50,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:50,624 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:50,625 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 04:26:50,625 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 1673 transitions, 54079 flow [2022-12-13 04:26:50,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:50,625 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:50,625 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:50,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 04:26:50,625 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:50,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1629238989, now seen corresponding path program 8 times [2022-12-13 04:26:50,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:50,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900880111] [2022-12-13 04:26:50,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:50,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:50,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:50,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900880111] [2022-12-13 04:26:50,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900880111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:50,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:50,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:26:50,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640543059] [2022-12-13 04:26:50,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:50,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:26:50,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:50,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:26:50,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:26:50,765 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:50,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 1673 transitions, 54079 flow. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:50,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:50,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:50,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:57,804 INFO L130 PetriNetUnfolder]: 16420/24241 cut-off events. [2022-12-13 04:26:57,804 INFO L131 PetriNetUnfolder]: For 1894/1894 co-relation queries the response was YES. [2022-12-13 04:26:57,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413981 conditions, 24241 events. 16420/24241 cut-off events. For 1894/1894 co-relation queries the response was YES. Maximal size of possible extension queue 1249. Compared 156399 event pairs, 194 based on Foata normal form. 182/24423 useless extension candidates. Maximal degree in co-relation 412878. Up to 24229 conditions per place. [2022-12-13 04:26:57,966 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 1563 selfloop transitions, 351 changer transitions 0/1914 dead transitions. [2022-12-13 04:26:57,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 1914 transitions, 65667 flow [2022-12-13 04:26:57,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:26:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:26:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-12-13 04:26:57,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28525641025641024 [2022-12-13 04:26:57,967 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 88 predicate places. [2022-12-13 04:26:57,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 1914 transitions, 65667 flow [2022-12-13 04:26:58,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 1914 transitions, 65667 flow [2022-12-13 04:26:58,265 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:58,265 INFO L89 Accepts]: Start accepts. Operand has 145 places, 1914 transitions, 65667 flow [2022-12-13 04:26:58,281 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:58,281 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:58,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 1914 transitions, 65667 flow [2022-12-13 04:26:58,310 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 1914 transitions, 65667 flow [2022-12-13 04:26:58,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:58,320 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:58,320 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 04:26:58,321 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 1914 transitions, 65667 flow [2022-12-13 04:26:58,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:58,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:58,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:58,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 04:26:58,321 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:26:58,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1077091233, now seen corresponding path program 9 times [2022-12-13 04:26:58,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:58,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267199801] [2022-12-13 04:26:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:58,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:58,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:58,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267199801] [2022-12-13 04:26:58,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267199801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:58,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:58,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:26:58,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681674978] [2022-12-13 04:26:58,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:58,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:26:58,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:58,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:26:58,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:26:58,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:26:58,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 1914 transitions, 65667 flow. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:58,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:58,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:26:58,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:27:06,746 INFO L130 PetriNetUnfolder]: 16446/24369 cut-off events. [2022-12-13 04:27:06,746 INFO L131 PetriNetUnfolder]: For 2019/2019 co-relation queries the response was YES. [2022-12-13 04:27:06,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440537 conditions, 24369 events. 16446/24369 cut-off events. For 2019/2019 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 159088 event pairs, 194 based on Foata normal form. 248/24617 useless extension candidates. Maximal degree in co-relation 439371. Up to 24357 conditions per place. [2022-12-13 04:27:07,025 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 1649 selfloop transitions, 391 changer transitions 0/2040 dead transitions. [2022-12-13 04:27:07,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 2040 transitions, 74061 flow [2022-12-13 04:27:07,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:27:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:27:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-12-13 04:27:07,027 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28525641025641024 [2022-12-13 04:27:07,034 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 95 predicate places. [2022-12-13 04:27:07,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 2040 transitions, 74061 flow [2022-12-13 04:27:07,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 2040 transitions, 74061 flow [2022-12-13 04:27:07,563 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:27:07,563 INFO L89 Accepts]: Start accepts. Operand has 152 places, 2040 transitions, 74061 flow [2022-12-13 04:27:07,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:27:07,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:27:07,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 2040 transitions, 74061 flow [2022-12-13 04:27:07,642 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 2040 transitions, 74061 flow [2022-12-13 04:27:07,642 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:27:07,654 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:27:07,657 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 04:27:07,657 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 2040 transitions, 74061 flow [2022-12-13 04:27:07,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:07,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:27:07,657 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:27:07,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 04:27:07,659 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:27:07,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:27:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash -580337907, now seen corresponding path program 10 times [2022-12-13 04:27:07,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:27:07,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562889410] [2022-12-13 04:27:07,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:27:07,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:27:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:27:07,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:27:07,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562889410] [2022-12-13 04:27:07,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562889410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:27:07,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:27:07,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:27:07,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125535624] [2022-12-13 04:27:07,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:27:07,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:27:07,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:27:07,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:27:07,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:27:07,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:27:07,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 2040 transitions, 74061 flow. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:07,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:27:07,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:27:07,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:27:16,960 INFO L130 PetriNetUnfolder]: 16741/25006 cut-off events. [2022-12-13 04:27:16,960 INFO L131 PetriNetUnfolder]: For 1945/1945 co-relation queries the response was YES. [2022-12-13 04:27:16,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477060 conditions, 25006 events. 16741/25006 cut-off events. For 1945/1945 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 166087 event pairs, 188 based on Foata normal form. 426/25432 useless extension candidates. Maximal degree in co-relation 475831. Up to 24994 conditions per place. [2022-12-13 04:27:17,292 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 1490 selfloop transitions, 693 changer transitions 101/2284 dead transitions. [2022-12-13 04:27:17,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 2284 transitions, 87476 flow [2022-12-13 04:27:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:27:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:27:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-13 04:27:17,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-13 04:27:17,293 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 102 predicate places. [2022-12-13 04:27:17,293 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 2284 transitions, 87476 flow [2022-12-13 04:27:17,468 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 2183 transitions, 83608 flow [2022-12-13 04:27:17,617 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:27:17,617 INFO L89 Accepts]: Start accepts. Operand has 159 places, 2183 transitions, 83608 flow [2022-12-13 04:27:17,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:27:17,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:27:17,638 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 2183 transitions, 83608 flow [2022-12-13 04:27:17,673 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 2183 transitions, 83608 flow [2022-12-13 04:27:17,673 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:27:17,683 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:27:17,684 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-13 04:27:17,684 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 2183 transitions, 83608 flow [2022-12-13 04:27:17,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:17,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:27:17,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:27:17,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 04:27:17,685 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:27:17,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:27:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1079970835, now seen corresponding path program 11 times [2022-12-13 04:27:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:27:17,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892315496] [2022-12-13 04:27:17,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:27:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:27:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:27:17,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:27:17,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892315496] [2022-12-13 04:27:17,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892315496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:27:17,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:27:17,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:27:17,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359841454] [2022-12-13 04:27:17,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:27:17,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:27:17,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:27:17,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:27:17,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:27:17,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:27:17,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 2183 transitions, 83608 flow. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:17,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:27:17,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:27:17,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:27:31,525 INFO L130 PetriNetUnfolder]: 19068/29055 cut-off events. [2022-12-13 04:27:31,525 INFO L131 PetriNetUnfolder]: For 2431/2431 co-relation queries the response was YES. [2022-12-13 04:27:31,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583408 conditions, 29055 events. 19068/29055 cut-off events. For 2431/2431 co-relation queries the response was YES. Maximal size of possible extension queue 1594. Compared 204928 event pairs, 332 based on Foata normal form. 836/29891 useless extension candidates. Maximal degree in co-relation 581710. Up to 29043 conditions per place. [2022-12-13 04:27:31,774 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 1575 selfloop transitions, 996 changer transitions 122/2693 dead transitions. [2022-12-13 04:27:31,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 2693 transitions, 108593 flow [2022-12-13 04:27:31,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:27:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:27:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2022-12-13 04:27:31,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37948717948717947 [2022-12-13 04:27:31,776 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 111 predicate places. [2022-12-13 04:27:31,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 2693 transitions, 108593 flow [2022-12-13 04:27:31,988 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 2571 transitions, 103668 flow [2022-12-13 04:27:32,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:27:32,283 INFO L89 Accepts]: Start accepts. Operand has 168 places, 2571 transitions, 103668 flow [2022-12-13 04:27:32,302 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:27:32,302 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:27:32,302 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 2571 transitions, 103668 flow [2022-12-13 04:27:32,346 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 2571 transitions, 103668 flow [2022-12-13 04:27:32,346 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:27:32,357 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:27:32,359 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 04:27:32,359 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 2571 transitions, 103668 flow [2022-12-13 04:27:32,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:32,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:27:32,359 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:27:32,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 04:27:32,360 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:27:32,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:27:32,360 INFO L85 PathProgramCache]: Analyzing trace with hash 168342541, now seen corresponding path program 12 times [2022-12-13 04:27:32,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:27:32,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454368340] [2022-12-13 04:27:32,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:27:32,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:27:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:32,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:27:32,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:27:32,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454368340] [2022-12-13 04:27:32,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454368340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:27:32,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:27:32,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:27:32,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544276448] [2022-12-13 04:27:32,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:27:32,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:27:32,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:27:32,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:27:32,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:27:32,535 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:27:32,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 2571 transitions, 103668 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:32,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:27:32,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:27:32,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:27:46,336 INFO L130 PetriNetUnfolder]: 18440/28185 cut-off events. [2022-12-13 04:27:46,336 INFO L131 PetriNetUnfolder]: For 2378/2378 co-relation queries the response was YES. [2022-12-13 04:27:46,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594092 conditions, 28185 events. 18440/28185 cut-off events. For 2378/2378 co-relation queries the response was YES. Maximal size of possible extension queue 1607. Compared 199250 event pairs, 276 based on Foata normal form. 470/28655 useless extension candidates. Maximal degree in co-relation 592311. Up to 28173 conditions per place. [2022-12-13 04:27:46,552 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 1653 selfloop transitions, 1005 changer transitions 46/2704 dead transitions. [2022-12-13 04:27:46,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 2704 transitions, 114447 flow [2022-12-13 04:27:46,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:27:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:27:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2022-12-13 04:27:46,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38974358974358975 [2022-12-13 04:27:46,553 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 120 predicate places. [2022-12-13 04:27:46,553 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 2704 transitions, 114447 flow [2022-12-13 04:27:46,772 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 2658 transitions, 112509 flow [2022-12-13 04:27:46,957 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:27:46,957 INFO L89 Accepts]: Start accepts. Operand has 177 places, 2658 transitions, 112509 flow [2022-12-13 04:27:46,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:27:46,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:27:46,984 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 2658 transitions, 112509 flow [2022-12-13 04:27:47,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 2658 transitions, 112509 flow [2022-12-13 04:27:47,033 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:27:47,044 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:27:47,045 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-13 04:27:47,045 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 2658 transitions, 112509 flow [2022-12-13 04:27:47,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:47,045 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:27:47,045 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:27:47,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 04:27:47,045 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:27:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:27:47,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1991954529, now seen corresponding path program 13 times [2022-12-13 04:27:47,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:27:47,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527993436] [2022-12-13 04:27:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:27:47,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:27:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:27:47,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:27:47,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527993436] [2022-12-13 04:27:47,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527993436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:27:47,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:27:47,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:27:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218779038] [2022-12-13 04:27:47,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:27:47,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:27:47,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:27:47,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:27:47,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:27:47,208 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:27:47,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 2658 transitions, 112509 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:47,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:27:47,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:27:47,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:28:03,170 INFO L130 PetriNetUnfolder]: 18668/28697 cut-off events. [2022-12-13 04:28:03,171 INFO L131 PetriNetUnfolder]: For 2408/2408 co-relation queries the response was YES. [2022-12-13 04:28:03,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633567 conditions, 28697 events. 18668/28697 cut-off events. For 2408/2408 co-relation queries the response was YES. Maximal size of possible extension queue 1649. Compared 205539 event pairs, 258 based on Foata normal form. 686/29383 useless extension candidates. Maximal degree in co-relation 631703. Up to 28685 conditions per place. [2022-12-13 04:28:03,472 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 2244 selfloop transitions, 794 changer transitions 217/3255 dead transitions. [2022-12-13 04:28:03,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 3255 transitions, 144234 flow [2022-12-13 04:28:03,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:28:03,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:28:03,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2022-12-13 04:28:03,474 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31837606837606836 [2022-12-13 04:28:03,474 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 131 predicate places. [2022-12-13 04:28:03,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 3255 transitions, 144234 flow [2022-12-13 04:28:03,716 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 188 places, 3038 transitions, 134614 flow [2022-12-13 04:28:03,913 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:28:03,913 INFO L89 Accepts]: Start accepts. Operand has 188 places, 3038 transitions, 134614 flow [2022-12-13 04:28:03,944 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:28:03,944 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:28:03,944 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 3038 transitions, 134614 flow [2022-12-13 04:28:04,067 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 3038 transitions, 134614 flow [2022-12-13 04:28:04,067 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:28:04,078 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:28:04,079 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-13 04:28:04,079 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 3038 transitions, 134614 flow [2022-12-13 04:28:04,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:28:04,079 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:28:04,079 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:28:04,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 04:28:04,079 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:28:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:28:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash 737349781, now seen corresponding path program 14 times [2022-12-13 04:28:04,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:28:04,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239890600] [2022-12-13 04:28:04,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:28:04,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:28:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:28:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:28:04,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:28:04,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239890600] [2022-12-13 04:28:04,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239890600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:28:04,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:28:04,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:28:04,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773220432] [2022-12-13 04:28:04,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:28:04,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:28:04,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:28:04,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:28:04,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:28:04,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:28:04,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 3038 transitions, 134614 flow. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:28:04,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:28:04,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:28:04,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:28:21,283 INFO L130 PetriNetUnfolder]: 18381/28364 cut-off events. [2022-12-13 04:28:21,283 INFO L131 PetriNetUnfolder]: For 2540/2540 co-relation queries the response was YES. [2022-12-13 04:28:21,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654594 conditions, 28364 events. 18381/28364 cut-off events. For 2540/2540 co-relation queries the response was YES. Maximal size of possible extension queue 1709. Compared 204966 event pairs, 236 based on Foata normal form. 560/28924 useless extension candidates. Maximal degree in co-relation 652647. Up to 28352 conditions per place. [2022-12-13 04:28:21,573 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 1868 selfloop transitions, 1310 changer transitions 30/3208 dead transitions. [2022-12-13 04:28:21,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 3208 transitions, 148588 flow [2022-12-13 04:28:21,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:28:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:28:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 169 transitions. [2022-12-13 04:28:21,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-13 04:28:21,575 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 142 predicate places. [2022-12-13 04:28:21,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 3208 transitions, 148588 flow [2022-12-13 04:28:21,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 3178 transitions, 147193 flow [2022-12-13 04:28:22,098 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:28:22,098 INFO L89 Accepts]: Start accepts. Operand has 199 places, 3178 transitions, 147193 flow [2022-12-13 04:28:22,124 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:28:22,125 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:28:22,125 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 3178 transitions, 147193 flow [2022-12-13 04:28:22,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 3178 transitions, 147193 flow [2022-12-13 04:28:22,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:28:22,204 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:28:22,205 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 04:28:22,205 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 3178 transitions, 147193 flow [2022-12-13 04:28:22,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:28:22,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:28:22,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:28:22,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 04:28:22,205 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:28:22,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:28:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1066753301, now seen corresponding path program 15 times [2022-12-13 04:28:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:28:22,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898214297] [2022-12-13 04:28:22,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:28:22,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:28:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:28:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:28:22,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:28:22,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898214297] [2022-12-13 04:28:22,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898214297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:28:22,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:28:22,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:28:22,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919741698] [2022-12-13 04:28:22,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:28:22,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:28:22,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:28:22,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:28:22,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:28:22,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:28:22,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 3178 transitions, 147193 flow. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:28:22,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:28:22,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:28:22,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:28:40,334 INFO L130 PetriNetUnfolder]: 17568/27165 cut-off events. [2022-12-13 04:28:40,334 INFO L131 PetriNetUnfolder]: For 2309/2309 co-relation queries the response was YES. [2022-12-13 04:28:40,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654048 conditions, 27165 events. 17568/27165 cut-off events. For 2309/2309 co-relation queries the response was YES. Maximal size of possible extension queue 1623. Compared 195630 event pairs, 254 based on Foata normal form. 142/27307 useless extension candidates. Maximal degree in co-relation 652115. Up to 27153 conditions per place. [2022-12-13 04:28:40,673 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 2165 selfloop transitions, 867 changer transitions 65/3097 dead transitions. [2022-12-13 04:28:40,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 3097 transitions, 149565 flow [2022-12-13 04:28:40,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:28:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:28:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2022-12-13 04:28:40,674 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33974358974358976 [2022-12-13 04:28:40,675 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 149 predicate places. [2022-12-13 04:28:40,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 3097 transitions, 149565 flow [2022-12-13 04:28:40,938 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 3032 transitions, 146421 flow [2022-12-13 04:28:41,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:28:41,210 INFO L89 Accepts]: Start accepts. Operand has 206 places, 3032 transitions, 146421 flow [2022-12-13 04:28:41,285 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:28:41,285 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:28:41,285 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 3032 transitions, 146421 flow [2022-12-13 04:28:41,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 3032 transitions, 146421 flow [2022-12-13 04:28:41,357 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:28:41,371 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:28:41,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-13 04:28:41,372 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 3032 transitions, 146421 flow [2022-12-13 04:28:41,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:28:41,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:28:41,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:28:41,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 04:28:41,372 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:28:41,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:28:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash -237489497, now seen corresponding path program 16 times [2022-12-13 04:28:41,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:28:41,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403561250] [2022-12-13 04:28:41,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:28:41,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:28:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:28:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:28:41,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:28:41,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403561250] [2022-12-13 04:28:41,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403561250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:28:41,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:28:41,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:28:41,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959146251] [2022-12-13 04:28:41,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:28:41,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:28:41,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:28:41,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:28:41,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:28:41,580 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:28:41,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 3032 transitions, 146421 flow. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:28:41,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:28:41,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:28:41,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:28:59,684 INFO L130 PetriNetUnfolder]: 17584/27209 cut-off events. [2022-12-13 04:28:59,686 INFO L131 PetriNetUnfolder]: For 2377/2377 co-relation queries the response was YES. [2022-12-13 04:28:59,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682310 conditions, 27209 events. 17584/27209 cut-off events. For 2377/2377 co-relation queries the response was YES. Maximal size of possible extension queue 1626. Compared 196035 event pairs, 220 based on Foata normal form. 174/27383 useless extension candidates. Maximal degree in co-relation 680298. Up to 27197 conditions per place. [2022-12-13 04:28:59,937 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 1617 selfloop transitions, 1469 changer transitions 19/3105 dead transitions. [2022-12-13 04:28:59,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 3105 transitions, 156168 flow [2022-12-13 04:28:59,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 04:28:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 04:28:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 194 transitions. [2022-12-13 04:28:59,938 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3553113553113553 [2022-12-13 04:28:59,938 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 162 predicate places. [2022-12-13 04:28:59,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 219 places, 3105 transitions, 156168 flow [2022-12-13 04:29:00,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 219 places, 3086 transitions, 155212 flow [2022-12-13 04:29:00,417 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:29:00,418 INFO L89 Accepts]: Start accepts. Operand has 219 places, 3086 transitions, 155212 flow [2022-12-13 04:29:00,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:29:00,463 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:29:00,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 3086 transitions, 155212 flow [2022-12-13 04:29:00,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 3086 transitions, 155212 flow [2022-12-13 04:29:00,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:29:00,577 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:29:00,577 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-13 04:29:00,577 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 3086 transitions, 155212 flow [2022-12-13 04:29:00,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:29:00,578 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:29:00,578 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:29:00,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 04:29:00,578 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:29:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:29:00,578 INFO L85 PathProgramCache]: Analyzing trace with hash -195663027, now seen corresponding path program 17 times [2022-12-13 04:29:00,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:29:00,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407696457] [2022-12-13 04:29:00,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:29:00,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:29:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:29:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:29:00,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:29:00,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407696457] [2022-12-13 04:29:00,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407696457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:29:00,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:29:00,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:29:00,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931921767] [2022-12-13 04:29:00,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:29:00,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:29:00,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:29:00,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:29:00,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:29:00,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:29:00,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 3086 transitions, 155212 flow. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:29:00,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:29:00,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:29:00,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:29:20,098 INFO L130 PetriNetUnfolder]: 17855/27746 cut-off events. [2022-12-13 04:29:20,098 INFO L131 PetriNetUnfolder]: For 2464/2464 co-relation queries the response was YES. [2022-12-13 04:29:20,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723530 conditions, 27746 events. 17855/27746 cut-off events. For 2464/2464 co-relation queries the response was YES. Maximal size of possible extension queue 1652. Compared 201721 event pairs, 232 based on Foata normal form. 58/27804 useless extension candidates. Maximal degree in co-relation 721229. Up to 27734 conditions per place. [2022-12-13 04:29:20,341 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 2180 selfloop transitions, 1714 changer transitions 142/4036 dead transitions. [2022-12-13 04:29:20,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 4036 transitions, 211081 flow [2022-12-13 04:29:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:29:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:29:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2022-12-13 04:29:20,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3473193473193473 [2022-12-13 04:29:20,342 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 172 predicate places. [2022-12-13 04:29:20,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 4036 transitions, 211081 flow [2022-12-13 04:29:20,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 3894 transitions, 203652 flow [2022-12-13 04:29:20,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:29:20,910 INFO L89 Accepts]: Start accepts. Operand has 229 places, 3894 transitions, 203652 flow [2022-12-13 04:29:20,946 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:29:20,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:29:20,946 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 3894 transitions, 203652 flow [2022-12-13 04:29:21,056 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 3894 transitions, 203652 flow [2022-12-13 04:29:21,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:29:21,069 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:29:21,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-13 04:29:21,070 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 3894 transitions, 203652 flow [2022-12-13 04:29:21,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:29:21,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:29:21,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:29:21,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 04:29:21,070 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:29:21,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:29:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2004558197, now seen corresponding path program 18 times [2022-12-13 04:29:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:29:21,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352928465] [2022-12-13 04:29:21,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:29:21,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:29:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:29:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:29:21,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:29:21,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352928465] [2022-12-13 04:29:21,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352928465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:29:21,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:29:21,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:29:21,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014716084] [2022-12-13 04:29:21,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:29:21,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:29:21,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:29:21,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:29:21,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:29:21,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:29:21,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 3894 transitions, 203652 flow. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:29:21,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:29:21,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:29:21,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:29:49,166 INFO L130 PetriNetUnfolder]: 16671/26048 cut-off events. [2022-12-13 04:29:49,166 INFO L131 PetriNetUnfolder]: For 2315/2315 co-relation queries the response was YES. [2022-12-13 04:29:49,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705253 conditions, 26048 events. 16671/26048 cut-off events. For 2315/2315 co-relation queries the response was YES. Maximal size of possible extension queue 1589. Compared 190068 event pairs, 194 based on Foata normal form. 406/26454 useless extension candidates. Maximal degree in co-relation 703411. Up to 26036 conditions per place. [2022-12-13 04:29:49,501 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 2092 selfloop transitions, 1485 changer transitions 211/3788 dead transitions. [2022-12-13 04:29:49,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 3788 transitions, 205617 flow [2022-12-13 04:29:49,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:29:49,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:29:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2022-12-13 04:29:49,502 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3641025641025641 [2022-12-13 04:29:49,502 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 181 predicate places. [2022-12-13 04:29:49,502 INFO L82 GeneralOperation]: Start removeDead. Operand has 238 places, 3788 transitions, 205617 flow [2022-12-13 04:29:49,804 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 3577 transitions, 194181 flow [2022-12-13 04:29:50,087 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:29:50,087 INFO L89 Accepts]: Start accepts. Operand has 238 places, 3577 transitions, 194181 flow [2022-12-13 04:29:50,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:29:50,143 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:29:50,143 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 3577 transitions, 194181 flow [2022-12-13 04:29:50,244 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 3577 transitions, 194181 flow [2022-12-13 04:29:50,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:29:50,257 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:29:50,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 04:29:50,257 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 3577 transitions, 194181 flow [2022-12-13 04:29:50,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:29:50,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:29:50,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:29:50,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 04:29:50,258 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:29:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:29:50,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1205908589, now seen corresponding path program 19 times [2022-12-13 04:29:50,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:29:50,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058207361] [2022-12-13 04:29:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:29:50,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:29:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:29:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:29:50,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:29:50,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058207361] [2022-12-13 04:29:50,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058207361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:29:50,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:29:50,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:29:50,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584901179] [2022-12-13 04:29:50,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:29:50,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:29:50,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:29:50,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:29:50,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:29:50,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:29:50,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 3577 transitions, 194181 flow. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:29:50,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:29:50,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:29:50,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:30:12,204 INFO L130 PetriNetUnfolder]: 15951/24996 cut-off events. [2022-12-13 04:30:12,205 INFO L131 PetriNetUnfolder]: For 2358/2358 co-relation queries the response was YES. [2022-12-13 04:30:12,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701812 conditions, 24996 events. 15951/24996 cut-off events. For 2358/2358 co-relation queries the response was YES. Maximal size of possible extension queue 1536. Compared 181665 event pairs, 166 based on Foata normal form. 642/25638 useless extension candidates. Maximal degree in co-relation 699903. Up to 24984 conditions per place. [2022-12-13 04:30:12,653 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 1892 selfloop transitions, 1779 changer transitions 123/3794 dead transitions. [2022-12-13 04:30:12,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 3794 transitions, 213580 flow [2022-12-13 04:30:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 04:30:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 04:30:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 200 transitions. [2022-12-13 04:30:12,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3663003663003663 [2022-12-13 04:30:12,660 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 194 predicate places. [2022-12-13 04:30:12,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 251 places, 3794 transitions, 213580 flow [2022-12-13 04:30:12,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 251 places, 3671 transitions, 206665 flow [2022-12-13 04:30:13,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:30:13,232 INFO L89 Accepts]: Start accepts. Operand has 251 places, 3671 transitions, 206665 flow [2022-12-13 04:30:13,283 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:30:13,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:30:13,284 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 251 places, 3671 transitions, 206665 flow [2022-12-13 04:30:13,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 251 places, 3671 transitions, 206665 flow [2022-12-13 04:30:13,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:30:13,401 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:30:13,401 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 04:30:13,402 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 3671 transitions, 206665 flow [2022-12-13 04:30:13,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:30:13,402 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:30:13,402 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:30:13,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 04:30:13,403 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:30:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:30:13,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1088690135, now seen corresponding path program 20 times [2022-12-13 04:30:13,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:30:13,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416243010] [2022-12-13 04:30:13,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:30:13,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:30:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:30:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:30:13,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:30:13,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416243010] [2022-12-13 04:30:13,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416243010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:30:13,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:30:13,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:30:13,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587939952] [2022-12-13 04:30:13,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:30:13,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:30:13,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:30:13,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:30:13,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:30:13,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:30:13,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 3671 transitions, 206665 flow. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:30:13,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:30:13,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:30:13,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:30:38,970 INFO L130 PetriNetUnfolder]: 14937/23524 cut-off events. [2022-12-13 04:30:38,970 INFO L131 PetriNetUnfolder]: For 2376/2376 co-relation queries the response was YES. [2022-12-13 04:30:39,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684047 conditions, 23524 events. 14937/23524 cut-off events. For 2376/2376 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 170711 event pairs, 210 based on Foata normal form. 456/23980 useless extension candidates. Maximal degree in co-relation 682071. Up to 23512 conditions per place. [2022-12-13 04:30:39,229 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 2026 selfloop transitions, 1500 changer transitions 137/3663 dead transitions. [2022-12-13 04:30:39,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 3663 transitions, 213552 flow [2022-12-13 04:30:39,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:30:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:30:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 165 transitions. [2022-12-13 04:30:39,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3525641025641026 [2022-12-13 04:30:39,230 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 205 predicate places. [2022-12-13 04:30:39,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 262 places, 3663 transitions, 213552 flow [2022-12-13 04:30:39,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 262 places, 3526 transitions, 205567 flow [2022-12-13 04:30:39,888 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:30:39,889 INFO L89 Accepts]: Start accepts. Operand has 262 places, 3526 transitions, 205567 flow [2022-12-13 04:30:39,936 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:30:39,936 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:30:39,936 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 262 places, 3526 transitions, 205567 flow [2022-12-13 04:30:40,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 262 places, 3526 transitions, 205567 flow [2022-12-13 04:30:40,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:30:40,054 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:30:40,056 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-13 04:30:40,056 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 3526 transitions, 205567 flow [2022-12-13 04:30:40,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:30:40,056 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:30:40,056 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:30:40,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 04:30:40,056 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:30:40,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:30:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1743104515, now seen corresponding path program 21 times [2022-12-13 04:30:40,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:30:40,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963784950] [2022-12-13 04:30:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:30:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:30:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:30:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:30:40,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:30:40,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963784950] [2022-12-13 04:30:40,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963784950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:30:40,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:30:40,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:30:40,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144451378] [2022-12-13 04:30:40,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:30:40,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:30:40,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:30:40,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:30:40,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:30:40,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:30:40,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 3526 transitions, 205567 flow. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:30:40,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:30:40,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:30:40,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:31:09,227 INFO L130 PetriNetUnfolder]: 15035/23688 cut-off events. [2022-12-13 04:31:09,227 INFO L131 PetriNetUnfolder]: For 2615/2615 co-relation queries the response was YES. [2022-12-13 04:31:09,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712539 conditions, 23688 events. 15035/23688 cut-off events. For 2615/2615 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 171897 event pairs, 154 based on Foata normal form. 8/23696 useless extension candidates. Maximal degree in co-relation 710011. Up to 23676 conditions per place. [2022-12-13 04:31:09,489 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 2010 selfloop transitions, 1591 changer transitions 0/3601 dead transitions. [2022-12-13 04:31:09,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 3601 transitions, 217170 flow [2022-12-13 04:31:09,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:31:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:31:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2022-12-13 04:31:09,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.372960372960373 [2022-12-13 04:31:09,491 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 215 predicate places. [2022-12-13 04:31:09,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 3601 transitions, 217170 flow [2022-12-13 04:31:09,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 272 places, 3601 transitions, 217170 flow [2022-12-13 04:31:10,119 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:31:10,119 INFO L89 Accepts]: Start accepts. Operand has 272 places, 3601 transitions, 217170 flow [2022-12-13 04:31:10,154 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:31:10,154 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:31:10,154 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 3601 transitions, 217170 flow [2022-12-13 04:31:10,250 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 3601 transitions, 217170 flow [2022-12-13 04:31:10,250 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:31:10,261 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:31:10,262 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 04:31:10,262 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 3601 transitions, 217170 flow [2022-12-13 04:31:10,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:31:10,262 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:31:10,262 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:31:10,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 04:31:10,262 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:31:10,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:31:10,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1240310157, now seen corresponding path program 22 times [2022-12-13 04:31:10,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:31:10,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54930400] [2022-12-13 04:31:10,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:31:10,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:31:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:31:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:31:10,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:31:10,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54930400] [2022-12-13 04:31:10,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54930400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:31:10,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:31:10,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:31:10,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74699673] [2022-12-13 04:31:10,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:31:10,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:31:10,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:31:10,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:31:10,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:31:10,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:31:10,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 3601 transitions, 217170 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:31:10,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:31:10,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:31:10,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:31:36,672 INFO L130 PetriNetUnfolder]: 15360/24243 cut-off events. [2022-12-13 04:31:36,672 INFO L131 PetriNetUnfolder]: For 2635/2635 co-relation queries the response was YES. [2022-12-13 04:31:36,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753457 conditions, 24243 events. 15360/24243 cut-off events. For 2635/2635 co-relation queries the response was YES. Maximal size of possible extension queue 1447. Compared 177328 event pairs, 182 based on Foata normal form. 196/24439 useless extension candidates. Maximal degree in co-relation 750846. Up to 24231 conditions per place. [2022-12-13 04:31:37,095 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 2214 selfloop transitions, 1515 changer transitions 8/3737 dead transitions. [2022-12-13 04:31:37,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 3737 transitions, 232831 flow [2022-12-13 04:31:37,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:31:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:31:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 176 transitions. [2022-12-13 04:31:37,096 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34714003944773175 [2022-12-13 04:31:37,097 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 227 predicate places. [2022-12-13 04:31:37,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 284 places, 3737 transitions, 232831 flow [2022-12-13 04:31:37,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 284 places, 3729 transitions, 232335 flow [2022-12-13 04:31:37,653 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:31:37,654 INFO L89 Accepts]: Start accepts. Operand has 284 places, 3729 transitions, 232335 flow [2022-12-13 04:31:37,710 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:31:37,710 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:31:37,710 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 284 places, 3729 transitions, 232335 flow [2022-12-13 04:31:37,828 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 284 places, 3729 transitions, 232335 flow [2022-12-13 04:31:37,829 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:31:37,841 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:31:37,841 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-13 04:31:37,841 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 3729 transitions, 232335 flow [2022-12-13 04:31:37,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:31:37,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:31:37,842 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:31:37,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 04:31:37,842 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:31:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:31:37,842 INFO L85 PathProgramCache]: Analyzing trace with hash 936559711, now seen corresponding path program 23 times [2022-12-13 04:31:37,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:31:37,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791728806] [2022-12-13 04:31:37,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:31:37,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:31:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:31:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:31:38,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:31:38,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791728806] [2022-12-13 04:31:38,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791728806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:31:38,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:31:38,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:31:38,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397660198] [2022-12-13 04:31:38,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:31:38,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:31:38,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:31:38,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:31:38,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:31:38,194 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:31:38,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 3729 transitions, 232335 flow. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:31:38,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:31:38,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:31:38,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:32:05,949 INFO L130 PetriNetUnfolder]: 15428/24425 cut-off events. [2022-12-13 04:32:05,949 INFO L131 PetriNetUnfolder]: For 2674/2674 co-relation queries the response was YES. [2022-12-13 04:32:05,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783556 conditions, 24425 events. 15428/24425 cut-off events. For 2674/2674 co-relation queries the response was YES. Maximal size of possible extension queue 1502. Compared 179701 event pairs, 166 based on Foata normal form. 184/24609 useless extension candidates. Maximal degree in co-relation 780862. Up to 24413 conditions per place. [2022-12-13 04:32:06,203 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 1981 selfloop transitions, 1745 changer transitions 76/3802 dead transitions. [2022-12-13 04:32:06,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 3802 transitions, 244507 flow [2022-12-13 04:32:06,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 04:32:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 04:32:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 202 transitions. [2022-12-13 04:32:06,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36996336996337 [2022-12-13 04:32:06,205 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 240 predicate places. [2022-12-13 04:32:06,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 3802 transitions, 244507 flow [2022-12-13 04:32:06,522 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 297 places, 3726 transitions, 239631 flow [2022-12-13 04:32:06,897 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:32:06,897 INFO L89 Accepts]: Start accepts. Operand has 297 places, 3726 transitions, 239631 flow [2022-12-13 04:32:06,938 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:32:06,938 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:32:06,938 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 297 places, 3726 transitions, 239631 flow [2022-12-13 04:32:07,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 297 places, 3726 transitions, 239631 flow [2022-12-13 04:32:07,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:32:07,060 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:32:07,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-13 04:32:07,061 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 3726 transitions, 239631 flow [2022-12-13 04:32:07,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:07,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:32:07,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:32:07,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 04:32:07,061 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:32:07,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:32:07,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1044271431, now seen corresponding path program 24 times [2022-12-13 04:32:07,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:32:07,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501990986] [2022-12-13 04:32:07,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:07,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:32:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:07,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:32:07,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501990986] [2022-12-13 04:32:07,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501990986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:32:07,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:32:07,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 04:32:07,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406734805] [2022-12-13 04:32:07,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:32:07,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 04:32:07,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:32:07,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 04:32:07,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 04:32:07,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:32:07,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 3726 transitions, 239631 flow. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:07,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:32:07,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:32:07,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:32:34,567 INFO L130 PetriNetUnfolder]: 15306/24253 cut-off events. [2022-12-13 04:32:34,567 INFO L131 PetriNetUnfolder]: For 2741/2741 co-relation queries the response was YES. [2022-12-13 04:32:34,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802320 conditions, 24253 events. 15306/24253 cut-off events. For 2741/2741 co-relation queries the response was YES. Maximal size of possible extension queue 1483. Compared 178782 event pairs, 134 based on Foata normal form. 174/24427 useless extension candidates. Maximal degree in co-relation 799543. Up to 24241 conditions per place. [2022-12-13 04:32:34,847 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 2017 selfloop transitions, 1754 changer transitions 19/3790 dead transitions. [2022-12-13 04:32:34,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 3790 transitions, 251340 flow [2022-12-13 04:32:34,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 04:32:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 04:32:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 207 transitions. [2022-12-13 04:32:34,848 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3317307692307692 [2022-12-13 04:32:34,848 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 255 predicate places. [2022-12-13 04:32:34,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 3790 transitions, 251340 flow [2022-12-13 04:32:35,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 3771 transitions, 250083 flow [2022-12-13 04:32:35,554 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:32:35,554 INFO L89 Accepts]: Start accepts. Operand has 312 places, 3771 transitions, 250083 flow [2022-12-13 04:32:35,594 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:32:35,594 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:32:35,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 312 places, 3771 transitions, 250083 flow [2022-12-13 04:32:35,698 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 312 places, 3771 transitions, 250083 flow [2022-12-13 04:32:35,698 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:32:35,720 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:32:35,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 04:32:35,721 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 3771 transitions, 250083 flow [2022-12-13 04:32:35,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:35,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:32:35,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:32:35,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 04:32:35,721 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:32:35,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:32:35,721 INFO L85 PathProgramCache]: Analyzing trace with hash -130613, now seen corresponding path program 25 times [2022-12-13 04:32:35,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:32:35,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690127303] [2022-12-13 04:32:35,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:35,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:32:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:35,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:32:35,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690127303] [2022-12-13 04:32:35,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690127303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:32:35,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:32:35,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:32:35,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256906562] [2022-12-13 04:32:35,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:32:35,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:32:35,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:32:35,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:32:35,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:32:35,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:32:35,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 3771 transitions, 250083 flow. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:35,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:32:35,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:32:35,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:33:02,610 INFO L130 PetriNetUnfolder]: 15614/24789 cut-off events. [2022-12-13 04:33:02,611 INFO L131 PetriNetUnfolder]: For 2734/2734 co-relation queries the response was YES. [2022-12-13 04:33:02,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844812 conditions, 24789 events. 15614/24789 cut-off events. For 2734/2734 co-relation queries the response was YES. Maximal size of possible extension queue 1571. Compared 184206 event pairs, 140 based on Foata normal form. 182/24971 useless extension candidates. Maximal degree in co-relation 841952. Up to 24777 conditions per place. [2022-12-13 04:33:02,930 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 2092 selfloop transitions, 1837 changer transitions 0/3929 dead transitions. [2022-12-13 04:33:02,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 3929 transitions, 268396 flow [2022-12-13 04:33:02,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 04:33:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 04:33:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 201 transitions. [2022-12-13 04:33:02,933 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3435897435897436 [2022-12-13 04:33:02,933 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 269 predicate places. [2022-12-13 04:33:02,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 326 places, 3929 transitions, 268396 flow [2022-12-13 04:33:03,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 326 places, 3929 transitions, 268396 flow [2022-12-13 04:33:03,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:33:03,607 INFO L89 Accepts]: Start accepts. Operand has 326 places, 3929 transitions, 268396 flow [2022-12-13 04:33:03,666 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:33:03,666 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:33:03,666 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 326 places, 3929 transitions, 268396 flow [2022-12-13 04:33:03,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 326 places, 3929 transitions, 268396 flow [2022-12-13 04:33:03,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:33:03,799 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:33:03,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-13 04:33:03,799 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 3929 transitions, 268396 flow [2022-12-13 04:33:03,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:03,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:33:03,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:33:03,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 04:33:03,800 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:33:03,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:33:03,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1474112819, now seen corresponding path program 26 times [2022-12-13 04:33:03,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:33:03,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450926621] [2022-12-13 04:33:03,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:33:03,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:33:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:33:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:33:04,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:33:04,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450926621] [2022-12-13 04:33:04,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450926621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:33:04,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:33:04,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:33:04,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501095236] [2022-12-13 04:33:04,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:33:04,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:33:04,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:33:04,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:33:04,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:33:04,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:33:04,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 3929 transitions, 268396 flow. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:04,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:33:04,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:33:04,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:33:36,492 INFO L130 PetriNetUnfolder]: 15661/24910 cut-off events. [2022-12-13 04:33:36,493 INFO L131 PetriNetUnfolder]: For 2874/2874 co-relation queries the response was YES. [2022-12-13 04:33:36,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873859 conditions, 24910 events. 15661/24910 cut-off events. For 2874/2874 co-relation queries the response was YES. Maximal size of possible extension queue 1553. Compared 186043 event pairs, 162 based on Foata normal form. 146/25056 useless extension candidates. Maximal degree in co-relation 870916. Up to 24898 conditions per place. [2022-12-13 04:33:36,775 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 2048 selfloop transitions, 1804 changer transitions 106/3958 dead transitions. [2022-12-13 04:33:36,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 3958 transitions, 278302 flow [2022-12-13 04:33:36,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 04:33:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 04:33:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 195 transitions. [2022-12-13 04:33:36,776 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-13 04:33:36,777 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 282 predicate places. [2022-12-13 04:33:36,777 INFO L82 GeneralOperation]: Start removeDead. Operand has 339 places, 3958 transitions, 278302 flow [2022-12-13 04:33:37,101 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 339 places, 3852 transitions, 270855 flow [2022-12-13 04:33:37,470 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:33:37,470 INFO L89 Accepts]: Start accepts. Operand has 339 places, 3852 transitions, 270855 flow [2022-12-13 04:33:37,510 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:33:37,510 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:33:37,510 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 339 places, 3852 transitions, 270855 flow [2022-12-13 04:33:37,620 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 339 places, 3852 transitions, 270855 flow [2022-12-13 04:33:37,620 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:33:37,631 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:33:37,631 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 04:33:37,632 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 3852 transitions, 270855 flow [2022-12-13 04:33:37,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:37,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:33:37,632 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:33:37,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 04:33:37,632 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:33:37,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:33:37,632 INFO L85 PathProgramCache]: Analyzing trace with hash 539217323, now seen corresponding path program 27 times [2022-12-13 04:33:37,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:33:37,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415946441] [2022-12-13 04:33:37,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:33:37,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:33:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:33:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:33:37,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:33:37,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415946441] [2022-12-13 04:33:37,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415946441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:33:37,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:33:37,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:33:37,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827114705] [2022-12-13 04:33:37,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:33:37,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:33:37,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:33:37,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:33:37,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:33:37,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:33:37,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 3852 transitions, 270855 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:37,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:33:37,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:33:37,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:34:01,548 INFO L130 PetriNetUnfolder]: 15386/24397 cut-off events. [2022-12-13 04:34:01,548 INFO L131 PetriNetUnfolder]: For 2780/2780 co-relation queries the response was YES. [2022-12-13 04:34:01,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880275 conditions, 24397 events. 15386/24397 cut-off events. For 2780/2780 co-relation queries the response was YES. Maximal size of possible extension queue 1545. Compared 180457 event pairs, 94 based on Foata normal form. 26/24423 useless extension candidates. Maximal degree in co-relation 877249. Up to 24385 conditions per place. [2022-12-13 04:34:01,907 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 2315 selfloop transitions, 1568 changer transitions 0/3883 dead transitions. [2022-12-13 04:34:01,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 3883 transitions, 280797 flow [2022-12-13 04:34:01,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:34:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:34:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 171 transitions. [2022-12-13 04:34:01,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33727810650887574 [2022-12-13 04:34:01,909 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 294 predicate places. [2022-12-13 04:34:01,909 INFO L82 GeneralOperation]: Start removeDead. Operand has 351 places, 3883 transitions, 280797 flow [2022-12-13 04:34:02,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 351 places, 3883 transitions, 280797 flow [2022-12-13 04:34:02,541 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:34:02,541 INFO L89 Accepts]: Start accepts. Operand has 351 places, 3883 transitions, 280797 flow [2022-12-13 04:34:02,577 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:34:02,577 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:34:02,577 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 351 places, 3883 transitions, 280797 flow [2022-12-13 04:34:02,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 351 places, 3883 transitions, 280797 flow [2022-12-13 04:34:02,690 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:34:02,700 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:34:02,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-13 04:34:02,701 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 3883 transitions, 280797 flow [2022-12-13 04:34:02,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:34:02,701 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:34:02,701 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:34:02,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 04:34:02,701 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:34:02,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:34:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1507606711, now seen corresponding path program 28 times [2022-12-13 04:34:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:34:02,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801336474] [2022-12-13 04:34:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:34:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:34:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:34:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:34:02,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:34:02,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801336474] [2022-12-13 04:34:02,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801336474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:34:02,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:34:02,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 04:34:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903304086] [2022-12-13 04:34:02,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:34:02,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 04:34:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:34:02,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 04:34:02,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-12-13 04:34:02,903 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:34:02,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 3883 transitions, 280797 flow. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:34:02,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:34:02,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:34:02,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:34:28,533 INFO L130 PetriNetUnfolder]: 15378/24389 cut-off events. [2022-12-13 04:34:28,534 INFO L131 PetriNetUnfolder]: For 2800/2800 co-relation queries the response was YES. [2022-12-13 04:34:28,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904377 conditions, 24389 events. 15378/24389 cut-off events. For 2800/2800 co-relation queries the response was YES. Maximal size of possible extension queue 1516. Compared 180398 event pairs, 190 based on Foata normal form. 8/24397 useless extension candidates. Maximal degree in co-relation 901268. Up to 24377 conditions per place. [2022-12-13 04:34:28,835 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 2271 selfloop transitions, 1948 changer transitions 79/4298 dead transitions. [2022-12-13 04:34:28,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 4298 transitions, 319387 flow [2022-12-13 04:34:28,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:34:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:34:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 156 transitions. [2022-12-13 04:34:28,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 04:34:28,837 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 305 predicate places. [2022-12-13 04:34:28,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 362 places, 4298 transitions, 319387 flow [2022-12-13 04:34:29,203 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 362 places, 4219 transitions, 313517 flow [2022-12-13 04:34:29,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:34:29,607 INFO L89 Accepts]: Start accepts. Operand has 362 places, 4219 transitions, 313517 flow [2022-12-13 04:34:29,649 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:34:29,650 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:34:29,651 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 362 places, 4219 transitions, 313517 flow [2022-12-13 04:34:29,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 362 places, 4219 transitions, 313517 flow [2022-12-13 04:34:29,795 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:34:29,808 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:34:29,813 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-13 04:34:29,813 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 4219 transitions, 313517 flow [2022-12-13 04:34:29,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:34:29,813 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:34:29,814 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:34:29,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 04:34:29,814 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:34:29,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:34:29,814 INFO L85 PathProgramCache]: Analyzing trace with hash 405968157, now seen corresponding path program 29 times [2022-12-13 04:34:29,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:34:29,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201803672] [2022-12-13 04:34:29,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:34:29,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:34:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:34:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:34:30,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:34:30,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201803672] [2022-12-13 04:34:30,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201803672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:34:30,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:34:30,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 04:34:30,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735860740] [2022-12-13 04:34:30,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:34:30,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 04:34:30,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:34:30,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 04:34:30,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 04:34:30,021 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:34:30,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 4219 transitions, 313517 flow. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:34:30,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:34:30,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:34:30,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:35:05,941 INFO L130 PetriNetUnfolder]: 15185/24116 cut-off events. [2022-12-13 04:35:05,941 INFO L131 PetriNetUnfolder]: For 2864/2864 co-relation queries the response was YES. [2022-12-13 04:35:05,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918383 conditions, 24116 events. 15185/24116 cut-off events. For 2864/2864 co-relation queries the response was YES. Maximal size of possible extension queue 1512. Compared 178428 event pairs, 136 based on Foata normal form. 180/24296 useless extension candidates. Maximal degree in co-relation 915191. Up to 24104 conditions per place. [2022-12-13 04:35:06,257 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 2266 selfloop transitions, 1993 changer transitions 38/4297 dead transitions. [2022-12-13 04:35:06,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 4297 transitions, 327922 flow [2022-12-13 04:35:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 04:35:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 04:35:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 213 transitions. [2022-12-13 04:35:06,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34134615384615385 [2022-12-13 04:35:06,259 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 320 predicate places. [2022-12-13 04:35:06,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 4297 transitions, 327922 flow [2022-12-13 04:35:06,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 377 places, 4259 transitions, 325028 flow [2022-12-13 04:35:06,965 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:35:06,965 INFO L89 Accepts]: Start accepts. Operand has 377 places, 4259 transitions, 325028 flow [2022-12-13 04:35:07,021 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:35:07,022 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:35:07,022 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 377 places, 4259 transitions, 325028 flow [2022-12-13 04:35:07,171 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 377 places, 4259 transitions, 325028 flow [2022-12-13 04:35:07,171 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:35:07,183 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:35:07,184 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-13 04:35:07,184 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 4259 transitions, 325028 flow [2022-12-13 04:35:07,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:35:07,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:35:07,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:35:07,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 04:35:07,185 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:35:07,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:35:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1461527249, now seen corresponding path program 30 times [2022-12-13 04:35:07,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:35:07,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719749798] [2022-12-13 04:35:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:35:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:35:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:35:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:35:07,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:35:07,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719749798] [2022-12-13 04:35:07,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719749798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:35:07,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:35:07,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 04:35:07,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974769275] [2022-12-13 04:35:07,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:35:07,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 04:35:07,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:35:07,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 04:35:07,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 04:35:07,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:35:07,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 4259 transitions, 325028 flow. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:35:07,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:35:07,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:35:07,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:35:37,482 INFO L130 PetriNetUnfolder]: 15019/23924 cut-off events. [2022-12-13 04:35:37,482 INFO L131 PetriNetUnfolder]: For 2869/2869 co-relation queries the response was YES. [2022-12-13 04:35:37,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935020 conditions, 23924 events. 15019/23924 cut-off events. For 2869/2869 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 177755 event pairs, 134 based on Foata normal form. 162/24086 useless extension candidates. Maximal degree in co-relation 931745. Up to 23912 conditions per place. [2022-12-13 04:35:37,890 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 2263 selfloop transitions, 2006 changer transitions 46/4315 dead transitions. [2022-12-13 04:35:37,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 4315 transitions, 337938 flow [2022-12-13 04:35:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 04:35:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 04:35:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 209 transitions. [2022-12-13 04:35:37,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3349358974358974 [2022-12-13 04:35:37,892 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 335 predicate places. [2022-12-13 04:35:37,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 392 places, 4315 transitions, 337938 flow [2022-12-13 04:35:38,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 4269 transitions, 334344 flow [2022-12-13 04:35:38,601 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:35:38,601 INFO L89 Accepts]: Start accepts. Operand has 392 places, 4269 transitions, 334344 flow [2022-12-13 04:35:38,645 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:35:38,645 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:35:38,646 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 392 places, 4269 transitions, 334344 flow [2022-12-13 04:35:38,784 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 392 places, 4269 transitions, 334344 flow [2022-12-13 04:35:38,784 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:35:38,795 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:35:38,796 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-13 04:35:38,796 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 4269 transitions, 334344 flow [2022-12-13 04:35:38,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:35:38,796 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:35:38,796 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:35:38,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 04:35:38,796 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:35:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:35:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1184630531, now seen corresponding path program 31 times [2022-12-13 04:35:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:35:38,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417780164] [2022-12-13 04:35:38,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:35:38,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:35:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:35:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:35:38,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:35:38,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417780164] [2022-12-13 04:35:38,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417780164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:35:38,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:35:38,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 04:35:38,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135380053] [2022-12-13 04:35:38,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:35:38,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 04:35:38,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:35:38,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 04:35:38,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 04:35:38,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:35:38,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 4269 transitions, 334344 flow. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:35:38,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:35:38,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:35:38,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:36:08,116 INFO L130 PetriNetUnfolder]: 14706/23507 cut-off events. [2022-12-13 04:36:08,116 INFO L131 PetriNetUnfolder]: For 2937/2937 co-relation queries the response was YES. [2022-12-13 04:36:08,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942267 conditions, 23507 events. 14706/23507 cut-off events. For 2937/2937 co-relation queries the response was YES. Maximal size of possible extension queue 1476. Compared 175613 event pairs, 144 based on Foata normal form. 168/23675 useless extension candidates. Maximal degree in co-relation 938909. Up to 23495 conditions per place. [2022-12-13 04:36:08,450 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 2239 selfloop transitions, 1960 changer transitions 61/4260 dead transitions. [2022-12-13 04:36:08,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 4260 transitions, 342171 flow [2022-12-13 04:36:08,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 04:36:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 04:36:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 215 transitions. [2022-12-13 04:36:08,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34455128205128205 [2022-12-13 04:36:08,452 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 350 predicate places. [2022-12-13 04:36:08,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 407 places, 4260 transitions, 342171 flow [2022-12-13 04:36:08,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 407 places, 4199 transitions, 337279 flow [2022-12-13 04:36:09,162 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:36:09,162 INFO L89 Accepts]: Start accepts. Operand has 407 places, 4199 transitions, 337279 flow [2022-12-13 04:36:09,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:36:09,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:36:09,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 407 places, 4199 transitions, 337279 flow [2022-12-13 04:36:09,350 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 407 places, 4199 transitions, 337279 flow [2022-12-13 04:36:09,350 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:36:09,362 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:36:09,362 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-13 04:36:09,362 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 4199 transitions, 337279 flow [2022-12-13 04:36:09,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:36:09,362 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:36:09,363 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:36:09,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 04:36:09,363 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:36:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:36:09,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1049760825, now seen corresponding path program 32 times [2022-12-13 04:36:09,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:36:09,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664753336] [2022-12-13 04:36:09,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:36:09,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:36:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:36:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:36:09,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:36:09,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664753336] [2022-12-13 04:36:09,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664753336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:36:09,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:36:09,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:36:09,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033115864] [2022-12-13 04:36:09,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:36:09,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:36:09,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:36:09,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:36:09,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:36:09,554 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:36:09,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 4199 transitions, 337279 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:36:09,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:36:09,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:36:09,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:36:44,042 INFO L130 PetriNetUnfolder]: 14807/23624 cut-off events. [2022-12-13 04:36:44,042 INFO L131 PetriNetUnfolder]: For 2975/2975 co-relation queries the response was YES. [2022-12-13 04:36:44,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970572 conditions, 23624 events. 14807/23624 cut-off events. For 2975/2975 co-relation queries the response was YES. Maximal size of possible extension queue 1529. Compared 176169 event pairs, 156 based on Foata normal form. 212/23836 useless extension candidates. Maximal degree in co-relation 967131. Up to 23612 conditions per place. [2022-12-13 04:36:44,486 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 2579 selfloop transitions, 1742 changer transitions 0/4321 dead transitions. [2022-12-13 04:36:44,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 4321 transitions, 355702 flow [2022-12-13 04:36:44,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:36:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:36:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 176 transitions. [2022-12-13 04:36:44,487 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34714003944773175 [2022-12-13 04:36:44,487 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 362 predicate places. [2022-12-13 04:36:44,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 419 places, 4321 transitions, 355702 flow [2022-12-13 04:36:44,859 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 419 places, 4321 transitions, 355702 flow [2022-12-13 04:36:45,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:36:45,229 INFO L89 Accepts]: Start accepts. Operand has 419 places, 4321 transitions, 355702 flow [2022-12-13 04:36:45,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:36:45,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:36:45,278 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 419 places, 4321 transitions, 355702 flow [2022-12-13 04:36:45,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 419 places, 4321 transitions, 355702 flow [2022-12-13 04:36:45,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:36:45,431 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:36:45,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-13 04:36:45,431 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 4321 transitions, 355702 flow [2022-12-13 04:36:45,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:36:45,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:36:45,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:36:45,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 04:36:45,432 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:36:45,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:36:45,432 INFO L85 PathProgramCache]: Analyzing trace with hash 616638169, now seen corresponding path program 33 times [2022-12-13 04:36:45,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:36:45,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657447116] [2022-12-13 04:36:45,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:36:45,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:36:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:36:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:36:45,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:36:45,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657447116] [2022-12-13 04:36:45,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657447116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:36:45,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:36:45,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:36:45,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824505976] [2022-12-13 04:36:45,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:36:45,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:36:45,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:36:45,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:36:45,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:36:45,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:36:45,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 4321 transitions, 355702 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:36:45,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:36:45,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:36:45,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:37:19,686 INFO L130 PetriNetUnfolder]: 14872/23787 cut-off events. [2022-12-13 04:37:19,686 INFO L131 PetriNetUnfolder]: For 2979/2979 co-relation queries the response was YES. [2022-12-13 04:37:19,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001084 conditions, 23787 events. 14872/23787 cut-off events. For 2979/2979 co-relation queries the response was YES. Maximal size of possible extension queue 1507. Compared 177348 event pairs, 176 based on Foata normal form. 8/23795 useless extension candidates. Maximal degree in co-relation 996883. Up to 23775 conditions per place. [2022-12-13 04:37:20,020 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 2130 selfloop transitions, 2066 changer transitions 157/4353 dead transitions. [2022-12-13 04:37:20,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 4353 transitions, 367068 flow [2022-12-13 04:37:20,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:37:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:37:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 171 transitions. [2022-12-13 04:37:20,022 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-13 04:37:20,022 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 373 predicate places. [2022-12-13 04:37:20,022 INFO L82 GeneralOperation]: Start removeDead. Operand has 430 places, 4353 transitions, 367068 flow [2022-12-13 04:37:20,652 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 430 places, 4196 transitions, 353847 flow [2022-12-13 04:37:20,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:37:20,985 INFO L89 Accepts]: Start accepts. Operand has 430 places, 4196 transitions, 353847 flow [2022-12-13 04:37:21,104 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:37:21,104 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:37:21,104 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 430 places, 4196 transitions, 353847 flow [2022-12-13 04:37:21,261 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 430 places, 4196 transitions, 353847 flow [2022-12-13 04:37:21,261 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:37:21,273 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:37:21,274 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 290 [2022-12-13 04:37:21,274 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 4196 transitions, 353847 flow [2022-12-13 04:37:21,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:37:21,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:37:21,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:37:21,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 04:37:21,274 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:37:21,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:37:21,275 INFO L85 PathProgramCache]: Analyzing trace with hash -489878885, now seen corresponding path program 9 times [2022-12-13 04:37:21,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:37:21,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289636729] [2022-12-13 04:37:21,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:37:21,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:37:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:37:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:37:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:37:21,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289636729] [2022-12-13 04:37:21,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289636729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:37:21,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:37:21,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:37:21,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778738487] [2022-12-13 04:37:21,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:37:21,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:37:21,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:37:21,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:37:21,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:37:21,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:37:21,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 4196 transitions, 353847 flow. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:37:21,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:37:21,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:37:21,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:37:58,157 INFO L130 PetriNetUnfolder]: 14704/23551 cut-off events. [2022-12-13 04:37:58,157 INFO L131 PetriNetUnfolder]: For 3015/3015 co-relation queries the response was YES. [2022-12-13 04:37:58,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014704 conditions, 23551 events. 14704/23551 cut-off events. For 3015/3015 co-relation queries the response was YES. Maximal size of possible extension queue 1569. Compared 176629 event pairs, 118 based on Foata normal form. 344/23895 useless extension candidates. Maximal degree in co-relation 1010404. Up to 23539 conditions per place. [2022-12-13 04:37:58,451 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 3650 selfloop transitions, 665 changer transitions 115/4430 dead transitions. [2022-12-13 04:37:58,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 4430 transitions, 382417 flow [2022-12-13 04:37:58,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:37:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:37:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 131 transitions. [2022-12-13 04:37:58,452 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2651821862348178 [2022-12-13 04:37:58,456 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 385 predicate places. [2022-12-13 04:37:58,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 442 places, 4430 transitions, 382417 flow [2022-12-13 04:37:58,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 442 places, 4315 transitions, 372497 flow [2022-12-13 04:37:59,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:37:59,293 INFO L89 Accepts]: Start accepts. Operand has 442 places, 4315 transitions, 372497 flow [2022-12-13 04:37:59,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:37:59,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:37:59,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 442 places, 4315 transitions, 372497 flow [2022-12-13 04:37:59,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 442 places, 4315 transitions, 372497 flow [2022-12-13 04:37:59,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:37:59,552 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:37:59,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 260 [2022-12-13 04:37:59,553 INFO L495 AbstractCegarLoop]: Abstraction has has 442 places, 4315 transitions, 372497 flow [2022-12-13 04:37:59,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:37:59,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:37:59,553 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:37:59,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 04:37:59,553 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:37:59,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:37:59,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2135811749, now seen corresponding path program 10 times [2022-12-13 04:37:59,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:37:59,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540477674] [2022-12-13 04:37:59,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:37:59,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:37:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:37:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:37:59,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:37:59,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540477674] [2022-12-13 04:37:59,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540477674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:37:59,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:37:59,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:37:59,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113760108] [2022-12-13 04:37:59,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:37:59,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:37:59,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:37:59,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:37:59,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:37:59,814 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:37:59,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 4315 transitions, 372497 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:37:59,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:37:59,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:37:59,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:38:34,137 INFO L130 PetriNetUnfolder]: 14582/23449 cut-off events. [2022-12-13 04:38:34,137 INFO L131 PetriNetUnfolder]: For 3017/3017 co-relation queries the response was YES. [2022-12-13 04:38:34,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033744 conditions, 23449 events. 14582/23449 cut-off events. For 3017/3017 co-relation queries the response was YES. Maximal size of possible extension queue 1556. Compared 176917 event pairs, 130 based on Foata normal form. 258/23707 useless extension candidates. Maximal degree in co-relation 1029345. Up to 23437 conditions per place. [2022-12-13 04:38:34,605 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 4115 selfloop transitions, 224 changer transitions 157/4496 dead transitions. [2022-12-13 04:38:34,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 4496 transitions, 397055 flow [2022-12-13 04:38:34,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:38:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:38:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-13 04:38:34,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2532894736842105 [2022-12-13 04:38:34,607 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 392 predicate places. [2022-12-13 04:38:34,607 INFO L82 GeneralOperation]: Start removeDead. Operand has 449 places, 4496 transitions, 397055 flow [2022-12-13 04:38:34,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 4339 transitions, 383236 flow [2022-12-13 04:38:35,381 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:38:35,382 INFO L89 Accepts]: Start accepts. Operand has 449 places, 4339 transitions, 383236 flow [2022-12-13 04:38:35,438 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:38:35,438 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:38:35,439 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 449 places, 4339 transitions, 383236 flow [2022-12-13 04:38:35,602 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 449 places, 4339 transitions, 383236 flow [2022-12-13 04:38:35,602 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:38:35,612 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:38:35,613 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-13 04:38:35,613 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 4339 transitions, 383236 flow [2022-12-13 04:38:35,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:38:35,613 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:38:35,613 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:38:35,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 04:38:35,613 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:38:35,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:38:35,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1207367525, now seen corresponding path program 11 times [2022-12-13 04:38:35,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:38:35,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238444490] [2022-12-13 04:38:35,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:38:35,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:38:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:38:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:38:35,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:38:35,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238444490] [2022-12-13 04:38:35,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238444490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:38:35,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:38:35,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:38:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969586453] [2022-12-13 04:38:35,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:38:35,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:38:35,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:38:35,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:38:35,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:38:35,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:38:35,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 4339 transitions, 383236 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:38:35,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:38:35,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:38:35,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:38:52,626 INFO L130 PetriNetUnfolder]: 7318/12251 cut-off events. [2022-12-13 04:38:52,626 INFO L131 PetriNetUnfolder]: For 1120/1120 co-relation queries the response was YES. [2022-12-13 04:38:52,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552291 conditions, 12251 events. 7318/12251 cut-off events. For 1120/1120 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 87431 event pairs, 90 based on Foata normal form. 472/12723 useless extension candidates. Maximal degree in co-relation 548699. Up to 12239 conditions per place. [2022-12-13 04:38:52,772 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 2276 selfloop transitions, 291 changer transitions 53/2620 dead transitions. [2022-12-13 04:38:52,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 2620 transitions, 236529 flow [2022-12-13 04:38:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:38:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:38:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-13 04:38:52,773 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2819548872180451 [2022-12-13 04:38:52,773 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 398 predicate places. [2022-12-13 04:38:52,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 455 places, 2620 transitions, 236529 flow [2022-12-13 04:38:52,961 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 455 places, 2567 transitions, 231750 flow [2022-12-13 04:38:53,201 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:38:53,201 INFO L89 Accepts]: Start accepts. Operand has 455 places, 2567 transitions, 231750 flow [2022-12-13 04:38:53,236 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:38:53,236 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:38:53,236 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 455 places, 2567 transitions, 231750 flow [2022-12-13 04:38:53,311 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 455 places, 2567 transitions, 231750 flow [2022-12-13 04:38:53,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:38:53,317 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:38:53,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 04:38:53,317 INFO L495 AbstractCegarLoop]: Abstraction has has 455 places, 2567 transitions, 231750 flow [2022-12-13 04:38:53,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:38:53,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:38:53,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:38:53,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 04:38:53,317 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:38:53,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:38:53,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1516820489, now seen corresponding path program 12 times [2022-12-13 04:38:53,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:38:53,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237170562] [2022-12-13 04:38:53,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:38:53,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:38:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:38:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:38:53,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:38:53,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237170562] [2022-12-13 04:38:53,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237170562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:38:53,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:38:53,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:38:53,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872501722] [2022-12-13 04:38:53,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:38:53,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:38:53,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:38:53,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:38:53,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:38:53,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:38:53,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 2567 transitions, 231750 flow. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:38:53,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:38:53,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:38:53,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:03,962 INFO L130 PetriNetUnfolder]: 6863/11692 cut-off events. [2022-12-13 04:39:03,963 INFO L131 PetriNetUnfolder]: For 1051/1051 co-relation queries the response was YES. [2022-12-13 04:39:03,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538782 conditions, 11692 events. 6863/11692 cut-off events. For 1051/1051 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 85009 event pairs, 56 based on Foata normal form. 434/12126 useless extension candidates. Maximal degree in co-relation 535111. Up to 11680 conditions per place. [2022-12-13 04:39:04,099 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 1641 selfloop transitions, 894 changer transitions 209/2744 dead transitions. [2022-12-13 04:39:04,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 2744 transitions, 253195 flow [2022-12-13 04:39:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 04:39:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 04:39:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 179 transitions. [2022-12-13 04:39:04,100 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2770897832817337 [2022-12-13 04:39:04,101 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 414 predicate places. [2022-12-13 04:39:04,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 471 places, 2744 transitions, 253195 flow [2022-12-13 04:39:04,283 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 471 places, 2535 transitions, 233913 flow [2022-12-13 04:39:04,414 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:04,414 INFO L89 Accepts]: Start accepts. Operand has 471 places, 2535 transitions, 233913 flow [2022-12-13 04:39:04,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:04,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:04,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 471 places, 2535 transitions, 233913 flow [2022-12-13 04:39:04,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 471 places, 2535 transitions, 233913 flow [2022-12-13 04:39:04,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:04,547 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:39:04,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 04:39:04,548 INFO L495 AbstractCegarLoop]: Abstraction has has 471 places, 2535 transitions, 233913 flow [2022-12-13 04:39:04,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:04,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:04,548 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:04,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 04:39:04,548 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:39:04,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:04,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1521332233, now seen corresponding path program 13 times [2022-12-13 04:39:04,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:04,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730450428] [2022-12-13 04:39:04,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:04,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:04,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:04,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730450428] [2022-12-13 04:39:04,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730450428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:04,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:04,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:39:04,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119834411] [2022-12-13 04:39:04,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:04,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:39:04,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:04,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:39:04,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:39:04,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:39:04,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 2535 transitions, 233913 flow. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:04,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:04,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:39:04,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:14,024 INFO L130 PetriNetUnfolder]: 6917/11726 cut-off events. [2022-12-13 04:39:14,024 INFO L131 PetriNetUnfolder]: For 1009/1009 co-relation queries the response was YES. [2022-12-13 04:39:14,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552049 conditions, 11726 events. 6917/11726 cut-off events. For 1009/1009 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 84662 event pairs, 46 based on Foata normal form. 96/11822 useless extension candidates. Maximal degree in co-relation 548299. Up to 11714 conditions per place. [2022-12-13 04:39:14,169 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 2401 selfloop transitions, 338 changer transitions 24/2763 dead transitions. [2022-12-13 04:39:14,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 2763 transitions, 260442 flow [2022-12-13 04:39:14,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 04:39:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 04:39:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 157 transitions. [2022-12-13 04:39:14,170 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24303405572755418 [2022-12-13 04:39:14,170 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 430 predicate places. [2022-12-13 04:39:14,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 487 places, 2763 transitions, 260442 flow [2022-12-13 04:39:14,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 487 places, 2739 transitions, 258180 flow [2022-12-13 04:39:14,596 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:14,596 INFO L89 Accepts]: Start accepts. Operand has 487 places, 2739 transitions, 258180 flow [2022-12-13 04:39:14,656 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:14,656 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:14,657 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 487 places, 2739 transitions, 258180 flow [2022-12-13 04:39:14,743 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 487 places, 2739 transitions, 258180 flow [2022-12-13 04:39:14,743 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:14,749 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:39:14,750 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-13 04:39:14,750 INFO L495 AbstractCegarLoop]: Abstraction has has 487 places, 2739 transitions, 258180 flow [2022-12-13 04:39:14,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:14,750 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:14,750 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:14,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 04:39:14,750 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:39:14,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:14,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1320321795, now seen corresponding path program 14 times [2022-12-13 04:39:14,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:14,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157903964] [2022-12-13 04:39:14,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:14,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:14,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:14,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157903964] [2022-12-13 04:39:14,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157903964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:14,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:14,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:39:14,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670531162] [2022-12-13 04:39:14,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:14,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:39:14,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:14,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:39:14,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:39:14,998 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:39:14,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 2739 transitions, 258180 flow. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:14,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:14,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:39:14,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:25,639 INFO L130 PetriNetUnfolder]: 7020/11993 cut-off events. [2022-12-13 04:39:25,639 INFO L131 PetriNetUnfolder]: For 1032/1032 co-relation queries the response was YES. [2022-12-13 04:39:25,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576614 conditions, 11993 events. 7020/11993 cut-off events. For 1032/1032 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 87896 event pairs, 54 based on Foata normal form. 136/12129 useless extension candidates. Maximal degree in co-relation 572785. Up to 11981 conditions per place. [2022-12-13 04:39:25,835 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 2482 selfloop transitions, 451 changer transitions 33/2966 dead transitions. [2022-12-13 04:39:25,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 2966 transitions, 285486 flow [2022-12-13 04:39:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 04:39:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 04:39:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 135 transitions. [2022-12-13 04:39:25,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25375939849624063 [2022-12-13 04:39:25,839 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 443 predicate places. [2022-12-13 04:39:25,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 500 places, 2966 transitions, 285486 flow [2022-12-13 04:39:26,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 500 places, 2933 transitions, 282309 flow [2022-12-13 04:39:26,234 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:26,234 INFO L89 Accepts]: Start accepts. Operand has 500 places, 2933 transitions, 282309 flow [2022-12-13 04:39:26,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:26,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:26,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 500 places, 2933 transitions, 282309 flow [2022-12-13 04:39:26,367 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 500 places, 2933 transitions, 282309 flow [2022-12-13 04:39:26,367 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:26,374 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:39:26,374 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 04:39:26,374 INFO L495 AbstractCegarLoop]: Abstraction has has 500 places, 2933 transitions, 282309 flow [2022-12-13 04:39:26,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:26,374 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:26,374 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:26,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 04:39:26,375 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 04:39:26,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:26,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1735714451, now seen corresponding path program 15 times [2022-12-13 04:39:26,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:26,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647483299] [2022-12-13 04:39:26,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:26,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:26,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647483299] [2022-12-13 04:39:26,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647483299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:26,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:26,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:39:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564476304] [2022-12-13 04:39:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:26,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:39:26,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:26,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:39:26,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:39:26,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:39:26,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 2933 transitions, 282309 flow. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:26,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:26,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:39:26,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 04:39:27,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 04:39:27,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 04:39:27,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 04:39:27,303 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/38 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 14247 conditions, 289 events (141/288 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 1857 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 14092. Up to 276 conditions per place.). [2022-12-13 04:39:27,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2022-12-13 04:39:27,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 04:39:27,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 04:39:27,318 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 04:39:27,321 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 04:39:27,321 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2022-12-13 04:39:27,322 INFO L445 BasicCegarLoop]: Path program histogram: [33, 15] [2022-12-13 04:39:27,328 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 04:39:27,328 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 04:39:27,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:39:27 BasicIcfg [2022-12-13 04:39:27,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 04:39:27,332 INFO L158 Benchmark]: Toolchain (without parser) took 809471.79ms. Allocated memory was 183.5MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 160.6MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 4.7GB. Max. memory is 8.0GB. [2022-12-13 04:39:27,332 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 183.5MB. Free memory was 159.3MB in the beginning and 159.2MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 04:39:27,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.69ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 142.8MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-13 04:39:27,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.42ms. Allocated memory is still 183.5MB. Free memory was 142.8MB in the beginning and 140.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:39:27,335 INFO L158 Benchmark]: Boogie Preprocessor took 33.80ms. Allocated memory is still 183.5MB. Free memory was 140.2MB in the beginning and 138.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:39:27,335 INFO L158 Benchmark]: RCFGBuilder took 476.90ms. Allocated memory is still 183.5MB. Free memory was 138.6MB in the beginning and 110.3MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 04:39:27,336 INFO L158 Benchmark]: TraceAbstraction took 808655.94ms. Allocated memory was 183.5MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 109.2MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2022-12-13 04:39:27,338 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-12-13 04:39:27,339 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 183.5MB. Free memory was 159.3MB in the beginning and 159.2MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.69ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 142.8MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.42ms. Allocated memory is still 183.5MB. Free memory was 142.8MB in the beginning and 140.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.80ms. Allocated memory is still 183.5MB. Free memory was 140.2MB in the beginning and 138.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 476.90ms. Allocated memory is still 183.5MB. Free memory was 138.6MB in the beginning and 110.3MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 808655.94ms. Allocated memory was 183.5MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 109.2MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5s, 176 PlacesBefore, 57 PlacesAfterwards, 159 TransitionsBefore, 38 TransitionsAfterwards, 3042 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 68 TrivialYvCompositions, 51 ConcurrentYvCompositions, 2 ChoiceCompositions, 121 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1562, independent: 1519, independent conditional: 1519, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1562, independent: 1519, independent conditional: 0, independent unconditional: 1519, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1562, independent: 1519, independent conditional: 0, independent unconditional: 1519, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1562, independent: 1519, independent conditional: 0, independent unconditional: 1519, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1521, independent: 1485, independent conditional: 0, independent unconditional: 1485, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1521, independent: 1397, independent conditional: 0, independent unconditional: 1397, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 124, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1562, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 1521, unknown conditional: 0, unknown unconditional: 1521] , Statistics on independence cache: Total cache size (in pairs): 2139, Positive cache size: 2103, Positive conditional cache size: 0, Positive unconditional cache size: 2103, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 62 PlacesBefore, 62 PlacesAfterwards, 95 TransitionsBefore, 95 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.4s, 69 PlacesBefore, 69 PlacesAfterwards, 195 TransitionsBefore, 195 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 73 PlacesBefore, 73 PlacesAfterwards, 195 TransitionsBefore, 195 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 77 PlacesBefore, 77 PlacesAfterwards, 239 TransitionsBefore, 239 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 81 PlacesBefore, 81 PlacesAfterwards, 305 TransitionsBefore, 305 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 85 PlacesBefore, 85 PlacesAfterwards, 385 TransitionsBefore, 385 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 77 PlacesBefore, 77 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 88 PlacesBefore, 88 PlacesAfterwards, 194 TransitionsBefore, 194 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 92 PlacesBefore, 92 PlacesAfterwards, 234 TransitionsBefore, 234 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 101 PlacesBefore, 101 PlacesAfterwards, 496 TransitionsBefore, 496 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 109 PlacesBefore, 109 PlacesAfterwards, 653 TransitionsBefore, 653 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 116 PlacesBefore, 116 PlacesAfterwards, 869 TransitionsBefore, 869 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 127 PlacesBefore, 127 PlacesAfterwards, 1259 TransitionsBefore, 1259 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 131 PlacesBefore, 131 PlacesAfterwards, 1258 TransitionsBefore, 1258 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 138 PlacesBefore, 138 PlacesAfterwards, 1673 TransitionsBefore, 1673 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 145 PlacesBefore, 145 PlacesAfterwards, 1914 TransitionsBefore, 1914 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 152 PlacesBefore, 152 PlacesAfterwards, 2040 TransitionsBefore, 2040 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 159 PlacesBefore, 159 PlacesAfterwards, 2183 TransitionsBefore, 2183 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 168 PlacesBefore, 168 PlacesAfterwards, 2571 TransitionsBefore, 2571 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 177 PlacesBefore, 177 PlacesAfterwards, 2658 TransitionsBefore, 2658 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 188 PlacesBefore, 188 PlacesAfterwards, 3038 TransitionsBefore, 3038 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 199 PlacesBefore, 199 PlacesAfterwards, 3178 TransitionsBefore, 3178 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 206 PlacesBefore, 206 PlacesAfterwards, 3032 TransitionsBefore, 3032 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 219 PlacesBefore, 219 PlacesAfterwards, 3086 TransitionsBefore, 3086 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 229 PlacesBefore, 229 PlacesAfterwards, 3894 TransitionsBefore, 3894 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 238 PlacesBefore, 238 PlacesAfterwards, 3577 TransitionsBefore, 3577 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 251 PlacesBefore, 251 PlacesAfterwards, 3671 TransitionsBefore, 3671 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 262 PlacesBefore, 262 PlacesAfterwards, 3526 TransitionsBefore, 3526 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 272 PlacesBefore, 272 PlacesAfterwards, 3601 TransitionsBefore, 3601 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 284 PlacesBefore, 284 PlacesAfterwards, 3729 TransitionsBefore, 3729 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 297 PlacesBefore, 297 PlacesAfterwards, 3726 TransitionsBefore, 3726 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 312 PlacesBefore, 312 PlacesAfterwards, 3771 TransitionsBefore, 3771 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 326 PlacesBefore, 326 PlacesAfterwards, 3929 TransitionsBefore, 3929 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 339 PlacesBefore, 339 PlacesAfterwards, 3852 TransitionsBefore, 3852 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 351 PlacesBefore, 351 PlacesAfterwards, 3883 TransitionsBefore, 3883 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 362 PlacesBefore, 362 PlacesAfterwards, 4219 TransitionsBefore, 4219 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 377 PlacesBefore, 377 PlacesAfterwards, 4259 TransitionsBefore, 4259 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 392 PlacesBefore, 392 PlacesAfterwards, 4269 TransitionsBefore, 4269 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 407 PlacesBefore, 407 PlacesAfterwards, 4199 TransitionsBefore, 4199 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 419 PlacesBefore, 419 PlacesAfterwards, 4321 TransitionsBefore, 4321 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 430 PlacesBefore, 430 PlacesAfterwards, 4196 TransitionsBefore, 4196 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 442 PlacesBefore, 442 PlacesAfterwards, 4315 TransitionsBefore, 4315 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 449 PlacesBefore, 449 PlacesAfterwards, 4339 TransitionsBefore, 4339 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 455 PlacesBefore, 455 PlacesAfterwards, 2567 TransitionsBefore, 2567 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 471 PlacesBefore, 471 PlacesAfterwards, 2535 TransitionsBefore, 2535 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 487 PlacesBefore, 487 PlacesAfterwards, 2739 TransitionsBefore, 2739 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 500 PlacesBefore, 500 PlacesAfterwards, 2933 TransitionsBefore, 2933 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 190]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/38 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 14247 conditions, 289 events (141/288 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 1857 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 14092. Up to 276 conditions per place.). - TimeoutResultAtElement [Line: 180]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/38 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 14247 conditions, 289 events (141/288 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 1857 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 14092. Up to 276 conditions per place.). - TimeoutResultAtElement [Line: 178]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/38 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 14247 conditions, 289 events (141/288 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 1857 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 14092. Up to 276 conditions per place.). - TimeoutResultAtElement [Line: 181]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/38 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 14247 conditions, 289 events (141/288 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 1857 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 14092. Up to 276 conditions per place.). - TimeoutResultAtElement [Line: 176]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/38 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 14247 conditions, 289 events (141/288 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 1857 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 14092. Up to 276 conditions per place.). - TimeoutResultAtElement [Line: 179]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/38 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 14247 conditions, 289 events (141/288 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 1857 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 14092. Up to 276 conditions per place.). - TimeoutResultAtElement [Line: 177]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/38 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 14247 conditions, 289 events (141/288 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 1857 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 14092. Up to 276 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 229 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: 808.5s, OverallIterations: 48, TraceHistogramMax: 1, PathProgramHistogramMax: 33, EmptinessCheckTime: 0.0s, AutomataDifference: 761.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3117 SdHoareTripleChecker+Valid, 10.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3117 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1566 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20603 IncrementalHoareTripleChecker+Invalid, 22169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1566 mSolverCounterUnsat, 0 mSDtfsCounter, 20603 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 598 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 478 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=383236occurred in iteration=43, InterpolantAutomatonStates: 503, 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, 1.5s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 1791 NumberOfCodeBlocks, 1791 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1743 ConstructedInterpolants, 0 QuantifiedInterpolants, 7015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 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 could not prove your program: Timeout Completed graceful shutdown [2022-12-13 04:39:27,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0